./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0504_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0504_1.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 ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:39:28,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:39:28,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:39:28,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:39:28,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:39:28,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:39:28,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:39:28,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:39:28,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:39:28,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:39:28,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:39:28,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:39:28,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:39:28,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:39:28,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:39:28,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:39:28,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:39:28,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:39:28,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:39:28,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:39:28,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:39:28,634 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:39:28,635 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:39:28,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:39:28,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:39:28,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:39:28,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:39:28,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:39:28,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:39:28,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:39:28,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:39:28,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:39:28,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:39:28,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:39:28,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:39:28,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:39:28,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:39:28,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:39:28,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:39:28,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:39:28,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:39:28,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:39:28,641 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 -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2024-11-19 06:39:28,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:39:28,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:39:28,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:39:28,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:39:28,938 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:39:28,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2024-11-19 06:39:30,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:39:30,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:39:30,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2024-11-19 06:39:30,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e0c9a74/e38e525f22014401be8e49afcf69f43f/FLAG89d460099 [2024-11-19 06:39:30,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e0c9a74/e38e525f22014401be8e49afcf69f43f [2024-11-19 06:39:30,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:39:30,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:39:30,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:39:30,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:39:30,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:39:30,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:39:30" (1/1) ... [2024-11-19 06:39:30,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c3e946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:30, skipping insertion in model container [2024-11-19 06:39:30,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:39:30" (1/1) ... [2024-11-19 06:39:30,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:39:31,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:39:31,141 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:39:31,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:39:31,215 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:39:31,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31 WrapperNode [2024-11-19 06:39:31,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:39:31,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:39:31,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:39:31,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:39:31,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,266 INFO L138 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2024-11-19 06:39:31,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:39:31,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:39:31,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:39:31,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:39:31,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,296 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-19 06:39:31,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:39:31,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:39:31,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:39:31,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:39:31,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (1/1) ... [2024-11-19 06:39:31,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:39:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:31,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:39:31,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:39:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:39:31,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:39:31,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:39:31,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:39:31,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:39:31,824 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-11-19 06:39:31,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:39:31,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:39:31,843 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 06:39:31,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:39:31 BoogieIcfgContainer [2024-11-19 06:39:31,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:39:31,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:39:31,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:39:31,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:39:31,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:39:30" (1/3) ... [2024-11-19 06:39:31,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de901e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:39:31, skipping insertion in model container [2024-11-19 06:39:31,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:31" (2/3) ... [2024-11-19 06:39:31,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de901e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:39:31, skipping insertion in model container [2024-11-19 06:39:31,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:39:31" (3/3) ... [2024-11-19 06:39:31,855 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2024-11-19 06:39:31,872 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:39:31,872 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2024-11-19 06:39:31,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:39:31,915 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;@34b0d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:39:31,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-11-19 06:39:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 95 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:39:31,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:31,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:39:31,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 28794281, now seen corresponding path program 1 times [2024-11-19 06:39:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:31,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798728629] [2024-11-19 06:39:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798728629] [2024-11-19 06:39:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798728629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:32,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384889134] [2024-11-19 06:39:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:39:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:39:32,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:39:32,157 INFO L87 Difference]: Start difference. First operand has 96 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 95 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,178 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-19 06:39:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:39:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:39:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,190 INFO L225 Difference]: With dead ends: 96 [2024-11-19 06:39:32,191 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 06:39:32,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:39:32,199 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 06:39:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-19 06:39:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-19 06:39:32,246 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 5 [2024-11-19 06:39:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-19 06:39:32,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-19 06:39:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:39:32,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:39:32,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:32,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1806850252, now seen corresponding path program 1 times [2024-11-19 06:39:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027915543] [2024-11-19 06:39:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027915543] [2024-11-19 06:39:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027915543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623077978] [2024-11-19 06:39:32,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:32,373 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,408 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-19 06:39:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:39:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,412 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:39:32,413 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:39:32,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:32,415 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:39:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 06:39:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-19 06:39:32,430 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 7 [2024-11-19 06:39:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,430 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-19 06:39:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-19 06:39:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:39:32,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:39:32,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2024-11-19 06:39:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556107470] [2024-11-19 06:39:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:32,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556107470] [2024-11-19 06:39:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556107470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:32,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545042199] [2024-11-19 06:39:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:32,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:32,573 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,688 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-19 06:39:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:32,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:39:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,690 INFO L225 Difference]: With dead ends: 90 [2024-11-19 06:39:32,690 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 06:39:32,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:32,691 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 88 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 06:39:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 06:39:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.8) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-19 06:39:32,705 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 7 [2024-11-19 06:39:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,706 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-19 06:39:32,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-19 06:39:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:39:32,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:39:32,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:32,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2024-11-19 06:39:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901821031] [2024-11-19 06:39:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:32,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901821031] [2024-11-19 06:39:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901821031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181754705] [2024-11-19 06:39:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:32,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:32,860 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,963 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-11-19 06:39:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:32,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:39:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,967 INFO L225 Difference]: With dead ends: 95 [2024-11-19 06:39:32,967 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 06:39:32,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:32,970 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 06:39:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-19 06:39:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-19 06:39:32,977 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 7 [2024-11-19 06:39:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,977 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-19 06:39:32,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-19 06:39:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:39:32,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:39:32,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:32,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash 177782697, now seen corresponding path program 1 times [2024-11-19 06:39:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614986972] [2024-11-19 06:39:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614986972] [2024-11-19 06:39:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614986972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515617307] [2024-11-19 06:39:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,026 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,102 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2024-11-19 06:39:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-19 06:39:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,104 INFO L225 Difference]: With dead ends: 94 [2024-11-19 06:39:33,104 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 06:39:33,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,105 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 06:39:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-19 06:39:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-19 06:39:33,116 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 8 [2024-11-19 06:39:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,116 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-19 06:39:33,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-19 06:39:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:39:33,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:33,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:39:33,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:33,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash 875833349, now seen corresponding path program 1 times [2024-11-19 06:39:33,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759968516] [2024-11-19 06:39:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759968516] [2024-11-19 06:39:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759968516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103512633] [2024-11-19 06:39:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:33,429 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,539 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-11-19 06:39:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:39:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,540 INFO L225 Difference]: With dead ends: 88 [2024-11-19 06:39:33,540 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 06:39:33,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:33,541 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 126 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 06:39:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-19 06:39:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 80 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-11-19 06:39:33,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 17 [2024-11-19 06:39:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,553 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-11-19 06:39:33,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-11-19 06:39:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:39:33,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:33,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:39:33,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:33,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1380999357, now seen corresponding path program 1 times [2024-11-19 06:39:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027350102] [2024-11-19 06:39:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027350102] [2024-11-19 06:39:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027350102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266723698] [2024-11-19 06:39:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:33,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,655 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,666 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2024-11-19 06:39:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:33,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:39:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,667 INFO L225 Difference]: With dead ends: 114 [2024-11-19 06:39:33,667 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 06:39:33,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,669 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 24 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 06:39:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2024-11-19 06:39:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 103 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2024-11-19 06:39:33,678 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 18 [2024-11-19 06:39:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,679 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2024-11-19 06:39:33,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2024-11-19 06:39:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:39:33,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:33,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:39:33,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:33,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1381030048, now seen corresponding path program 1 times [2024-11-19 06:39:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044125513] [2024-11-19 06:39:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044125513] [2024-11-19 06:39:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044125513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350208976] [2024-11-19 06:39:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,765 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,822 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2024-11-19 06:39:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:33,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:39:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,823 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:39:33,823 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:39:33,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,824 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 107 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:39:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 06:39:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2024-11-19 06:39:33,832 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 18 [2024-11-19 06:39:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,833 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2024-11-19 06:39:33,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2024-11-19 06:39:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:39:33,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:33,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:39:33,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:33,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1381030049, now seen corresponding path program 1 times [2024-11-19 06:39:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307462741] [2024-11-19 06:39:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307462741] [2024-11-19 06:39:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307462741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236748200] [2024-11-19 06:39:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,934 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,984 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2024-11-19 06:39:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:39:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,985 INFO L225 Difference]: With dead ends: 96 [2024-11-19 06:39:33,985 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 06:39:33,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:33,986 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 06:39:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 06:39:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-11-19 06:39:33,989 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 18 [2024-11-19 06:39:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,989 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-11-19 06:39:33,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-11-19 06:39:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:39:33,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,990 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] [2024-11-19 06:39:33,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:39:33,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:33,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash 774470346, now seen corresponding path program 1 times [2024-11-19 06:39:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463476478] [2024-11-19 06:39:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463476478] [2024-11-19 06:39:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463476478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215651146] [2024-11-19 06:39:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:34,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:34,259 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:34,397 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2024-11-19 06:39:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-19 06:39:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:34,399 INFO L225 Difference]: With dead ends: 132 [2024-11-19 06:39:34,399 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 06:39:34,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:34,400 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:34,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 235 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 06:39:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2024-11-19 06:39:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2024-11-19 06:39:34,409 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 21 [2024-11-19 06:39:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:34,409 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2024-11-19 06:39:34,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2024-11-19 06:39:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:39:34,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:34,410 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] [2024-11-19 06:39:34,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:39:34,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:34,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:34,411 INFO L85 PathProgramCache]: Analyzing trace with hash 774470347, now seen corresponding path program 1 times [2024-11-19 06:39:34,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:34,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327240714] [2024-11-19 06:39:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:34,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327240714] [2024-11-19 06:39:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327240714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:34,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:39:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881920879] [2024-11-19 06:39:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:39:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:34,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:39:34,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:39:34,986 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:35,285 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2024-11-19 06:39:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:35,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-19 06:39:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:35,286 INFO L225 Difference]: With dead ends: 131 [2024-11-19 06:39:35,286 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 06:39:35,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:39:35,287 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 111 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:35,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 287 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 06:39:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2024-11-19 06:39:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2024-11-19 06:39:35,291 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 21 [2024-11-19 06:39:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:35,292 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2024-11-19 06:39:35,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2024-11-19 06:39:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:39:35,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:35,293 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] [2024-11-19 06:39:35,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:39:35,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:35,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:35,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1442610665, now seen corresponding path program 1 times [2024-11-19 06:39:35,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929023880] [2024-11-19 06:39:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929023880] [2024-11-19 06:39:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929023880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:35,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585327501] [2024-11-19 06:39:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:35,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:35,375 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:35,494 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-19 06:39:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:35,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 06:39:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:35,495 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:39:35,495 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:39:35,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:35,496 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:35,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:39:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2024-11-19 06:39:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2024-11-19 06:39:35,499 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 23 [2024-11-19 06:39:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:35,499 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2024-11-19 06:39:35,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2024-11-19 06:39:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:39:35,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:35,500 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] [2024-11-19 06:39:35,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:39:35,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:35,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1442610666, now seen corresponding path program 1 times [2024-11-19 06:39:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480452087] [2024-11-19 06:39:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480452087] [2024-11-19 06:39:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480452087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64043805] [2024-11-19 06:39:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:35,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:35,600 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:35,707 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-11-19 06:39:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:35,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 06:39:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:35,709 INFO L225 Difference]: With dead ends: 151 [2024-11-19 06:39:35,709 INFO L226 Difference]: Without dead ends: 151 [2024-11-19 06:39:35,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:35,710 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:35,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 161 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-19 06:39:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2024-11-19 06:39:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 140 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 168 transitions. [2024-11-19 06:39:35,714 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 168 transitions. Word has length 23 [2024-11-19 06:39:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:35,714 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 168 transitions. [2024-11-19 06:39:35,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 168 transitions. [2024-11-19 06:39:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:39:35,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:35,715 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] [2024-11-19 06:39:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:39:35,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1771257388, now seen corresponding path program 1 times [2024-11-19 06:39:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665897906] [2024-11-19 06:39:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:35,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665897906] [2024-11-19 06:39:35,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665897906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926968712] [2024-11-19 06:39:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:35,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:35,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:35,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:39:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:35,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:39:35,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:35,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:39:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926968712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:39:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-19 06:39:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030534972] [2024-11-19 06:39:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:35,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:35,943 INFO L87 Difference]: Start difference. First operand 141 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:35,960 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2024-11-19 06:39:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:35,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-19 06:39:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:35,962 INFO L225 Difference]: With dead ends: 141 [2024-11-19 06:39:35,962 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 06:39:35,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:35,963 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:35,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 110 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 06:39:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-19 06:39:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.360655737704918) internal successors, (166), 140 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 166 transitions. [2024-11-19 06:39:35,966 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 166 transitions. Word has length 24 [2024-11-19 06:39:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:35,966 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 166 transitions. [2024-11-19 06:39:35,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 166 transitions. [2024-11-19 06:39:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:39:35,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:35,967 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] [2024-11-19 06:39:35,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:39:36,171 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,SelfDestructingSolverStorable13 [2024-11-19 06:39:36,172 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -925584694, now seen corresponding path program 1 times [2024-11-19 06:39:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687522659] [2024-11-19 06:39:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687522659] [2024-11-19 06:39:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687522659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448338768] [2024-11-19 06:39:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:36,239 INFO L87 Difference]: Start difference. First operand 141 states and 166 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:36,430 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2024-11-19 06:39:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:36,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 06:39:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:36,432 INFO L225 Difference]: With dead ends: 166 [2024-11-19 06:39:36,432 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 06:39:36,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:36,434 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:36,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 155 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 06:39:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2024-11-19 06:39:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 151 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2024-11-19 06:39:36,441 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 25 [2024-11-19 06:39:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:36,442 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2024-11-19 06:39:36,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2024-11-19 06:39:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:39:36,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:36,443 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] [2024-11-19 06:39:36,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:39:36,443 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash -925584693, now seen corresponding path program 1 times [2024-11-19 06:39:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069946016] [2024-11-19 06:39:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:36,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:36,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069946016] [2024-11-19 06:39:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069946016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:36,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056940381] [2024-11-19 06:39:36,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:36,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:36,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:36,660 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:36,831 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions. [2024-11-19 06:39:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 06:39:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:36,833 INFO L225 Difference]: With dead ends: 186 [2024-11-19 06:39:36,833 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 06:39:36,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:36,834 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 51 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:36,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 191 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 06:39:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2024-11-19 06:39:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 171 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2024-11-19 06:39:36,838 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 25 [2024-11-19 06:39:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:36,839 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2024-11-19 06:39:36,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2024-11-19 06:39:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:39:36,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:36,842 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] [2024-11-19 06:39:36,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:39:36,842 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash -403485996, now seen corresponding path program 1 times [2024-11-19 06:39:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402726013] [2024-11-19 06:39:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402726013] [2024-11-19 06:39:37,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402726013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:37,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078434226] [2024-11-19 06:39:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:37,057 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:37,293 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2024-11-19 06:39:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:39:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:39:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:37,294 INFO L225 Difference]: With dead ends: 207 [2024-11-19 06:39:37,295 INFO L226 Difference]: Without dead ends: 207 [2024-11-19 06:39:37,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:37,295 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 65 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:37,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 225 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-19 06:39:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 183. [2024-11-19 06:39:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 164 states have (on average 1.4390243902439024) internal successors, (236), 182 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 236 transitions. [2024-11-19 06:39:37,300 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 236 transitions. Word has length 28 [2024-11-19 06:39:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:37,300 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 236 transitions. [2024-11-19 06:39:37,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 236 transitions. [2024-11-19 06:39:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:39:37,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:37,302 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] [2024-11-19 06:39:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:39:37,302 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:37,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -403485995, now seen corresponding path program 1 times [2024-11-19 06:39:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112561279] [2024-11-19 06:39:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:37,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112561279] [2024-11-19 06:39:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112561279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976461723] [2024-11-19 06:39:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:37,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:39:37,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:37,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:39:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:37,597 INFO L87 Difference]: Start difference. First operand 183 states and 236 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:37,760 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2024-11-19 06:39:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:37,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:39:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:37,761 INFO L225 Difference]: With dead ends: 190 [2024-11-19 06:39:37,762 INFO L226 Difference]: Without dead ends: 190 [2024-11-19 06:39:37,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:39:37,762 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:37,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 334 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-19 06:39:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2024-11-19 06:39:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 181 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 233 transitions. [2024-11-19 06:39:37,766 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 233 transitions. Word has length 28 [2024-11-19 06:39:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:37,766 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 233 transitions. [2024-11-19 06:39:37,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 233 transitions. [2024-11-19 06:39:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:39:37,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:37,766 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] [2024-11-19 06:39:37,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:39:37,767 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:37,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash 376834961, now seen corresponding path program 1 times [2024-11-19 06:39:37,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:37,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669192575] [2024-11-19 06:39:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:37,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669192575] [2024-11-19 06:39:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669192575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:37,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:37,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465626993] [2024-11-19 06:39:37,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:37,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:37,837 INFO L87 Difference]: Start difference. First operand 182 states and 233 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:37,967 INFO L93 Difference]: Finished difference Result 213 states and 270 transitions. [2024-11-19 06:39:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:37,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 06:39:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:37,968 INFO L225 Difference]: With dead ends: 213 [2024-11-19 06:39:37,968 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 06:39:37,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:37,969 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 75 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:37,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 260 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 06:39:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 202. [2024-11-19 06:39:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 183 states have (on average 1.4754098360655739) internal successors, (270), 201 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 270 transitions. [2024-11-19 06:39:37,973 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 270 transitions. Word has length 29 [2024-11-19 06:39:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:37,973 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 270 transitions. [2024-11-19 06:39:37,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 270 transitions. [2024-11-19 06:39:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:37,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:37,974 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] [2024-11-19 06:39:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:39:37,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:37,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash -754000399, now seen corresponding path program 1 times [2024-11-19 06:39:37,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064408717] [2024-11-19 06:39:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064408717] [2024-11-19 06:39:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064408717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577962549] [2024-11-19 06:39:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:38,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:38,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:38,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:39:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:38,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:39:38,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:38,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577962549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:38,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-19 06:39:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387168580] [2024-11-19 06:39:38,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:38,271 INFO L87 Difference]: Start difference. First operand 202 states and 270 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:38,298 INFO L93 Difference]: Finished difference Result 257 states and 336 transitions. [2024-11-19 06:39:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 06:39:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:38,300 INFO L225 Difference]: With dead ends: 257 [2024-11-19 06:39:38,300 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 06:39:38,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:38,301 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:38,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 240 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 06:39:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 244. [2024-11-19 06:39:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 225 states have (on average 1.4933333333333334) internal successors, (336), 243 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 336 transitions. [2024-11-19 06:39:38,307 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 336 transitions. Word has length 32 [2024-11-19 06:39:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:38,307 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 336 transitions. [2024-11-19 06:39:38,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 336 transitions. [2024-11-19 06:39:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:39:38,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:38,308 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] [2024-11-19 06:39:38,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-19 06:39:38,512 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:38,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1899176156, now seen corresponding path program 1 times [2024-11-19 06:39:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470809887] [2024-11-19 06:39:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470809887] [2024-11-19 06:39:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470809887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127594827] [2024-11-19 06:39:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:38,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:38,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:38,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:38,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:39:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:38,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:39:38,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:38,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:39:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:38,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:38,936 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)))) is different from false [2024-11-19 06:39:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:39:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127594827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:38,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:38,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2024-11-19 06:39:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594393634] [2024-11-19 06:39:38,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:38,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:38,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-19 06:39:38,956 INFO L87 Difference]: Start difference. First operand 244 states and 336 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:39,100 INFO L93 Difference]: Finished difference Result 249 states and 340 transitions. [2024-11-19 06:39:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:39,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 06:39:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:39,102 INFO L225 Difference]: With dead ends: 249 [2024-11-19 06:39:39,102 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 06:39:39,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:39:39,102 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:39,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 266 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2024-11-19 06:39:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 06:39:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-19 06:39:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 218 states have (on average 1.5045871559633028) internal successors, (328), 236 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2024-11-19 06:39:39,106 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 33 [2024-11-19 06:39:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:39,106 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2024-11-19 06:39:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2024-11-19 06:39:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:39:39,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:39,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:39,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:39:39,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:39,312 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2117281920, now seen corresponding path program 1 times [2024-11-19 06:39:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845098699] [2024-11-19 06:39:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845098699] [2024-11-19 06:39:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845098699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769999875] [2024-11-19 06:39:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:39,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:39,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:39:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:39,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:39:39,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:39,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:39:39,679 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:39:39,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:39:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:39,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769999875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:39,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2024-11-19 06:39:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046376745] [2024-11-19 06:39:39,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:39,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:39:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:39:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:39,898 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:40,061 INFO L93 Difference]: Finished difference Result 258 states and 345 transitions. [2024-11-19 06:39:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 06:39:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:40,063 INFO L225 Difference]: With dead ends: 258 [2024-11-19 06:39:40,064 INFO L226 Difference]: Without dead ends: 258 [2024-11-19 06:39:40,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:40,064 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 124 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:40,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 165 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-19 06:39:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2024-11-19 06:39:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.4954128440366972) internal successors, (326), 235 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 326 transitions. [2024-11-19 06:39:40,070 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 326 transitions. Word has length 34 [2024-11-19 06:39:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:40,070 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 326 transitions. [2024-11-19 06:39:40,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 326 transitions. [2024-11-19 06:39:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:39:40,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:40,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:40,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:40,272 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:40,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2117281919, now seen corresponding path program 1 times [2024-11-19 06:39:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430491451] [2024-11-19 06:39:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:40,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430491451] [2024-11-19 06:39:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430491451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273290762] [2024-11-19 06:39:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:40,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:40,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:40,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:39:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:40,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:39:40,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:40,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:39:40,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:39:40,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:40,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:39:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:40,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:41,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-19 06:39:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273290762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:41,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:41,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2024-11-19 06:39:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649529437] [2024-11-19 06:39:41,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:41,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:39:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:39:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:41,265 INFO L87 Difference]: Start difference. First operand 236 states and 326 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:41,479 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2024-11-19 06:39:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 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 34 [2024-11-19 06:39:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:41,480 INFO L225 Difference]: With dead ends: 257 [2024-11-19 06:39:41,480 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 06:39:41,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:39:41,481 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 309 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:41,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 175 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 06:39:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2024-11-19 06:39:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 218 states have (on average 1.4862385321100917) internal successors, (324), 234 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 324 transitions. [2024-11-19 06:39:41,486 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 324 transitions. Word has length 34 [2024-11-19 06:39:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:41,486 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 324 transitions. [2024-11-19 06:39:41,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 324 transitions. [2024-11-19 06:39:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:39:41,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:41,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:41,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:41,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 06:39:41,688 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -499896363, now seen corresponding path program 1 times [2024-11-19 06:39:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942412321] [2024-11-19 06:39:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942412321] [2024-11-19 06:39:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942412321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270874084] [2024-11-19 06:39:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:42,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:42,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:42,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:42,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:39:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:42,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 06:39:42,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:42,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:39:42,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:39:42,210 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-19 06:39:42,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 06:39:42,271 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 06:39:42,271 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 25 treesize of output 20 [2024-11-19 06:39:42,310 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:39:42,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 06:39:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:42,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270874084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:42,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2024-11-19 06:39:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639734124] [2024-11-19 06:39:42,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:39:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:39:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:42,375 INFO L87 Difference]: Start difference. First operand 235 states and 324 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:42,536 INFO L93 Difference]: Finished difference Result 234 states and 322 transitions. [2024-11-19 06:39:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:39:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:42,538 INFO L225 Difference]: With dead ends: 234 [2024-11-19 06:39:42,538 INFO L226 Difference]: Without dead ends: 234 [2024-11-19 06:39:42,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:39:42,538 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:42,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 232 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-19 06:39:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-19 06:39:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 218 states have (on average 1.4770642201834863) internal successors, (322), 233 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 322 transitions. [2024-11-19 06:39:42,543 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 322 transitions. Word has length 35 [2024-11-19 06:39:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:42,543 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 322 transitions. [2024-11-19 06:39:42,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 322 transitions. [2024-11-19 06:39:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:39:42,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:42,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:42,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:42,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:42,749 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:42,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash -499896362, now seen corresponding path program 1 times [2024-11-19 06:39:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:42,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068417957] [2024-11-19 06:39:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:42,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068417957] [2024-11-19 06:39:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068417957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709469929] [2024-11-19 06:39:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:43,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:43,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:43,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:39:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:43,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:39:43,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:43,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:39:43,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:39:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:43,473 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-19 06:39:43,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 06:39:43,568 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 06:39:43,568 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 25 treesize of output 20 [2024-11-19 06:39:43,586 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 06:39:43,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:39:43,658 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:39:43,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 06:39:43,668 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:39:43,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 15 treesize of output 7 [2024-11-19 06:39:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:43,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709469929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:43,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2024-11-19 06:39:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704094711] [2024-11-19 06:39:43,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:43,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:39:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:39:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:39:43,971 INFO L87 Difference]: Start difference. First operand 234 states and 322 transitions. Second operand has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:44,469 INFO L93 Difference]: Finished difference Result 242 states and 329 transitions. [2024-11-19 06:39:44,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:39:44,470 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:39:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:44,471 INFO L225 Difference]: With dead ends: 242 [2024-11-19 06:39:44,471 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 06:39:44,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:39:44,472 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:44,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 548 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:39:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 06:39:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 221. [2024-11-19 06:39:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 206 states have (on average 1.4951456310679612) internal successors, (308), 220 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 308 transitions. [2024-11-19 06:39:44,480 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 308 transitions. Word has length 35 [2024-11-19 06:39:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:44,480 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 308 transitions. [2024-11-19 06:39:44,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 308 transitions. [2024-11-19 06:39:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:39:44,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:44,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:44,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:44,682 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 841882677, now seen corresponding path program 1 times [2024-11-19 06:39:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003187654] [2024-11-19 06:39:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003187654] [2024-11-19 06:39:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003187654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077898629] [2024-11-19 06:39:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:45,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:45,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:45,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:39:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:45,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:39:45,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:45,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:39:45,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:39:45,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:45,433 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 18 [2024-11-19 06:39:45,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:39:45,522 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:39:45,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:39:45,540 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:45,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:39:45,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-11-19 06:39:45,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-19 06:39:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:45,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077898629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:45,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 4] total 17 [2024-11-19 06:39:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750091821] [2024-11-19 06:39:45,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:39:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:39:45,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:39:45,974 INFO L87 Difference]: Start difference. First operand 221 states and 308 transitions. Second operand has 18 states, 17 states have (on average 5.235294117647059) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:46,422 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2024-11-19 06:39:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:39:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.235294117647059) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:39:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:46,424 INFO L225 Difference]: With dead ends: 265 [2024-11-19 06:39:46,424 INFO L226 Difference]: Without dead ends: 265 [2024-11-19 06:39:46,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:39:46,425 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 106 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:46,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 389 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:39:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-19 06:39:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 242. [2024-11-19 06:39:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 227 states have (on average 1.4669603524229076) internal successors, (333), 241 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 333 transitions. [2024-11-19 06:39:46,430 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 333 transitions. Word has length 37 [2024-11-19 06:39:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:46,430 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 333 transitions. [2024-11-19 06:39:46,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.235294117647059) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 333 transitions. [2024-11-19 06:39:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:39:46,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:46,431 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:46,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 06:39:46,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 06:39:46,632 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:46,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1595402838, now seen corresponding path program 1 times [2024-11-19 06:39:46,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:46,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206589586] [2024-11-19 06:39:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:47,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206589586] [2024-11-19 06:39:47,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206589586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019238869] [2024-11-19 06:39:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:47,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:47,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:47,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:39:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:47,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:39:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:47,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:47,329 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 21 treesize of output 20 [2024-11-19 06:39:47,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:47,361 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 17 treesize of output 7 [2024-11-19 06:39:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:39:47,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:39:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019238869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:47,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:39:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2024-11-19 06:39:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388747587] [2024-11-19 06:39:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:47,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:47,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:47,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:39:47,433 INFO L87 Difference]: Start difference. First operand 242 states and 333 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:47,595 INFO L93 Difference]: Finished difference Result 258 states and 340 transitions. [2024-11-19 06:39:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:47,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 06:39:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:47,597 INFO L225 Difference]: With dead ends: 258 [2024-11-19 06:39:47,597 INFO L226 Difference]: Without dead ends: 258 [2024-11-19 06:39:47,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:39:47,598 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 87 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:47,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 211 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-19 06:39:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2024-11-19 06:39:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 227 states have (on average 1.4581497797356828) internal successors, (331), 241 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 331 transitions. [2024-11-19 06:39:47,603 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 331 transitions. Word has length 39 [2024-11-19 06:39:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:47,604 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 331 transitions. [2024-11-19 06:39:47,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 331 transitions. [2024-11-19 06:39:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:39:47,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:47,605 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:47,624 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-19 06:39:47,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 06:39:47,807 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash 537912129, now seen corresponding path program 1 times [2024-11-19 06:39:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685777546] [2024-11-19 06:39:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:39:47,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:47,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685777546] [2024-11-19 06:39:47,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685777546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:47,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:47,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626663487] [2024-11-19 06:39:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:47,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:47,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:47,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:47,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:47,901 INFO L87 Difference]: Start difference. First operand 242 states and 331 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:47,961 INFO L93 Difference]: Finished difference Result 250 states and 327 transitions. [2024-11-19 06:39:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:47,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-19 06:39:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:47,962 INFO L225 Difference]: With dead ends: 250 [2024-11-19 06:39:47,963 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 06:39:47,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:47,963 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:47,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 167 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 06:39:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 201. [2024-11-19 06:39:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 186 states have (on average 1.4301075268817205) internal successors, (266), 200 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 266 transitions. [2024-11-19 06:39:47,969 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 266 transitions. Word has length 42 [2024-11-19 06:39:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:47,969 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 266 transitions. [2024-11-19 06:39:47,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 266 transitions. [2024-11-19 06:39:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:39:47,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:47,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:39:47,970 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 537912169, now seen corresponding path program 1 times [2024-11-19 06:39:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522852231] [2024-11-19 06:39:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:48,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522852231] [2024-11-19 06:39:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522852231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287997462] [2024-11-19 06:39:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:48,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:48,145 INFO L87 Difference]: Start difference. First operand 201 states and 266 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:48,352 INFO L93 Difference]: Finished difference Result 236 states and 312 transitions. [2024-11-19 06:39:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:39:48,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 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 42 [2024-11-19 06:39:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:48,354 INFO L225 Difference]: With dead ends: 236 [2024-11-19 06:39:48,355 INFO L226 Difference]: Without dead ends: 236 [2024-11-19 06:39:48,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:48,356 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:48,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 247 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-19 06:39:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 214. [2024-11-19 06:39:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 213 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2024-11-19 06:39:48,364 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 42 [2024-11-19 06:39:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:48,364 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2024-11-19 06:39:48,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2024-11-19 06:39:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:39:48,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:48,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:48,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 06:39:48,365 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 537912170, now seen corresponding path program 1 times [2024-11-19 06:39:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:48,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079920763] [2024-11-19 06:39:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:48,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:48,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079920763] [2024-11-19 06:39:48,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079920763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:48,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:48,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474744936] [2024-11-19 06:39:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:48,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:48,689 INFO L87 Difference]: Start difference. First operand 214 states and 285 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:48,928 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2024-11-19 06:39:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:39:48,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 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 42 [2024-11-19 06:39:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:48,930 INFO L225 Difference]: With dead ends: 247 [2024-11-19 06:39:48,930 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 06:39:48,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:48,931 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 30 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:48,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 348 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 06:39:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2024-11-19 06:39:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 213 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 283 transitions. [2024-11-19 06:39:48,936 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 283 transitions. Word has length 42 [2024-11-19 06:39:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 283 transitions. [2024-11-19 06:39:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 283 transitions. [2024-11-19 06:39:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:39:48,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:48,937 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 06:39:48,938 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1537522282, now seen corresponding path program 1 times [2024-11-19 06:39:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918648767] [2024-11-19 06:39:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:39:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918648767] [2024-11-19 06:39:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918648767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679769206] [2024-11-19 06:39:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:49,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:49,018 INFO L87 Difference]: Start difference. First operand 214 states and 283 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:49,084 INFO L93 Difference]: Finished difference Result 215 states and 277 transitions. [2024-11-19 06:39:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 44 [2024-11-19 06:39:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:49,085 INFO L225 Difference]: With dead ends: 215 [2024-11-19 06:39:49,085 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 06:39:49,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:49,086 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:49,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 06:39:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-19 06:39:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 199 states have (on average 1.3768844221105527) internal successors, (274), 211 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 274 transitions. [2024-11-19 06:39:49,092 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 274 transitions. Word has length 44 [2024-11-19 06:39:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:49,092 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 274 transitions. [2024-11-19 06:39:49,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 274 transitions. [2024-11-19 06:39:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:39:49,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:49,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:49,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 06:39:49,095 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:49,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1537522283, now seen corresponding path program 1 times [2024-11-19 06:39:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064190239] [2024-11-19 06:39:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064190239] [2024-11-19 06:39:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064190239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:39:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046825196] [2024-11-19 06:39:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:39:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:39:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:39:49,484 INFO L87 Difference]: Start difference. First operand 212 states and 274 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:49,823 INFO L93 Difference]: Finished difference Result 253 states and 326 transitions. [2024-11-19 06:39:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:39:49,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-19 06:39:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:49,824 INFO L225 Difference]: With dead ends: 253 [2024-11-19 06:39:49,825 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 06:39:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:39:49,826 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:49,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 414 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:39:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 06:39:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2024-11-19 06:39:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 215 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2024-11-19 06:39:49,831 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 44 [2024-11-19 06:39:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2024-11-19 06:39:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2024-11-19 06:39:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:39:49,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:49,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:49,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 06:39:49,833 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 90166762, now seen corresponding path program 1 times [2024-11-19 06:39:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138388926] [2024-11-19 06:39:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138388926] [2024-11-19 06:39:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138388926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:39:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253860641] [2024-11-19 06:39:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:50,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:39:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:39:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:39:50,156 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:50,476 INFO L93 Difference]: Finished difference Result 251 states and 322 transitions. [2024-11-19 06:39:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:39:50,476 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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 46 [2024-11-19 06:39:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:50,477 INFO L225 Difference]: With dead ends: 251 [2024-11-19 06:39:50,477 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 06:39:50,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:39:50,480 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:50,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 481 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 06:39:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2024-11-19 06:39:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 219 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2024-11-19 06:39:50,483 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 284 transitions. Word has length 46 [2024-11-19 06:39:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:50,483 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 284 transitions. [2024-11-19 06:39:50,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 284 transitions. [2024-11-19 06:39:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 06:39:50,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:50,484 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2024-11-19 06:39:50,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 06:39:50,484 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:39:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1817243348, now seen corresponding path program 1 times [2024-11-19 06:39:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975790903] [2024-11-19 06:39:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975790903] [2024-11-19 06:39:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975790903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562690476] [2024-11-19 06:39:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:51,172 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:51,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:39:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:51,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 06:39:51,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:51,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:39:51,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:51,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:51,431 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 18 [2024-11-19 06:39:51,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:39:51,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:39:51,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:39:51,639 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:51,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:39:51,703 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 16 [2024-11-19 06:39:51,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:39:51,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:39:51,745 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 16 [2024-11-19 06:39:51,764 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 16 [2024-11-19 06:39:51,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:39:51,788 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 16 [2024-11-19 06:39:51,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:39:51,812 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 16 [2024-11-19 06:39:51,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:39:51,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:51,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 06:39:51,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:51,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 06:39:51,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:39:51,998 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 65 treesize of output 58 [2024-11-19 06:39:52,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2024-11-19 06:39:52,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:52,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:52,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:52,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2024-11-19 06:39:52,206 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 7 treesize of output 3 [2024-11-19 06:39:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:52,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:52,349 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2030) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_2031 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2031) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2024-11-19 06:39:55,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12))) (and (forall ((v_ArrVal_2029 Int) (v_ArrVal_2031 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~last~0#1.base|) .cse0 v_ArrVal_2029)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2031) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (forall ((v_ArrVal_2030 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2030) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)))) is different from false [2024-11-19 06:40:06,100 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 72 treesize of output 70 [2024-11-19 06:40:06,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:40:06,112 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 5 treesize of output 3 [2024-11-19 06:40:06,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:40:06,120 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-19 06:40:06,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 1 [2024-11-19 06:40:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-19 06:40:06,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562690476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:06,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:06,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 34 [2024-11-19 06:40:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105919670] [2024-11-19 06:40:06,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:06,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 06:40:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:06,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 06:40:06,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=870, Unknown=21, NotChecked=122, Total=1122 [2024-11-19 06:40:06,164 INFO L87 Difference]: Start difference. First operand 220 states and 284 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:10,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:14,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:18,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:23,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:27,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:31,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:35,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:40:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:36,098 INFO L93 Difference]: Finished difference Result 262 states and 331 transitions. [2024-11-19 06:40:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:40:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 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 47 [2024-11-19 06:40:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:36,100 INFO L225 Difference]: With dead ends: 262 [2024-11-19 06:40:36,100 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 06:40:36,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=294, Invalid=1855, Unknown=21, NotChecked=182, Total=2352 [2024-11-19 06:40:36,101 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 44 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:36,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1114 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1086 Invalid, 8 Unknown, 198 Unchecked, 29.3s Time] [2024-11-19 06:40:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 06:40:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2024-11-19 06:40:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 226 states have (on average 1.3628318584070795) internal successors, (308), 238 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 308 transitions. [2024-11-19 06:40:36,106 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 308 transitions. Word has length 47 [2024-11-19 06:40:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:36,106 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 308 transitions. [2024-11-19 06:40:36,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 308 transitions. [2024-11-19 06:40:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 06:40:36,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:36,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:36,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:40:36,307 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,SelfDestructingSolverStorable33 [2024-11-19 06:40:36,308 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:40:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1729190831, now seen corresponding path program 1 times [2024-11-19 06:40:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107633828] [2024-11-19 06:40:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107633828] [2024-11-19 06:40:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107633828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914928690] [2024-11-19 06:40:36,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:36,522 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:40:36,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:40:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:36,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:40:36,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:36,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:40:36,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:40:36,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:40:36,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:40:36,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:36,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2024-11-19 06:40:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:36,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:37,092 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 11 treesize of output 9 [2024-11-19 06:40:37,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-19 06:40:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914928690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:37,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-11-19 06:40:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578845655] [2024-11-19 06:40:37,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:37,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:40:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:40:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:40:37,218 INFO L87 Difference]: Start difference. First operand 239 states and 308 transitions. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:37,747 INFO L93 Difference]: Finished difference Result 290 states and 365 transitions. [2024-11-19 06:40:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:40:37,748 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 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 47 [2024-11-19 06:40:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:37,749 INFO L225 Difference]: With dead ends: 290 [2024-11-19 06:40:37,749 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 06:40:37,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:40:37,750 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 119 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:37,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 783 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:40:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 06:40:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 239. [2024-11-19 06:40:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 226 states have (on average 1.3539823008849559) internal successors, (306), 238 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 306 transitions. [2024-11-19 06:40:37,754 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 306 transitions. Word has length 47 [2024-11-19 06:40:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:37,755 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 306 transitions. [2024-11-19 06:40:37,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 306 transitions. [2024-11-19 06:40:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 06:40:37,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:37,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:37,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 06:40:37,959 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,SelfDestructingSolverStorable34 [2024-11-19 06:40:37,960 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:40:37,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1499797498, now seen corresponding path program 1 times [2024-11-19 06:40:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725349897] [2024-11-19 06:40:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:38,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:38,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725349897] [2024-11-19 06:40:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725349897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:40:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440190832] [2024-11-19 06:40:38,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:40:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:38,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:40:38,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:40:38,156 INFO L87 Difference]: Start difference. First operand 239 states and 306 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:38,411 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2024-11-19 06:40:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:40:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-19 06:40:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:38,413 INFO L225 Difference]: With dead ends: 274 [2024-11-19 06:40:38,413 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 06:40:38,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:40:38,414 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 39 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:38,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 413 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:40:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 06:40:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 241. [2024-11-19 06:40:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 228 states have (on average 1.3508771929824561) internal successors, (308), 240 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 308 transitions. [2024-11-19 06:40:38,419 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 308 transitions. Word has length 47 [2024-11-19 06:40:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:38,419 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 308 transitions. [2024-11-19 06:40:38,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 308 transitions. [2024-11-19 06:40:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:40:38,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:38,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:38,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 06:40:38,420 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:40:38,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -827931788, now seen corresponding path program 2 times [2024-11-19 06:40:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:38,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924596431] [2024-11-19 06:40:38,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:40:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:38,442 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:40:38,442 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:40:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:40:38,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:38,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924596431] [2024-11-19 06:40:38,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924596431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304090136] [2024-11-19 06:40:38,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:40:38,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:38,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:38,484 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:40:38,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 06:40:38,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:40:38,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:40:38,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:40:38,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:40:38,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:40:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304090136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:38,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-19 06:40:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081708902] [2024-11-19 06:40:38,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:38,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:40:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:40:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:40:38,796 INFO L87 Difference]: Start difference. First operand 241 states and 308 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:38,850 INFO L93 Difference]: Finished difference Result 221 states and 279 transitions. [2024-11-19 06:40:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:40:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-19 06:40:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:38,852 INFO L225 Difference]: With dead ends: 221 [2024-11-19 06:40:38,852 INFO L226 Difference]: Without dead ends: 221 [2024-11-19 06:40:38,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:40:38,853 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:38,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 163 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-19 06:40:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2024-11-19 06:40:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 215 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 272 transitions. [2024-11-19 06:40:38,857 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 272 transitions. Word has length 48 [2024-11-19 06:40:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:38,857 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 272 transitions. [2024-11-19 06:40:38,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2024-11-19 06:40:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:40:38,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:38,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:38,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 06:40:39,062 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,SelfDestructingSolverStorable36 [2024-11-19 06:40:39,063 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-19 06:40:39,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 751163565, now seen corresponding path program 1 times [2024-11-19 06:40:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:39,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045358586] [2024-11-19 06:40:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:40,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045358586] [2024-11-19 06:40:40,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045358586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:40,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026317687] [2024-11-19 06:40:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:40,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:40,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:40,106 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:40:40,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 06:40:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:40,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 06:40:40,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:40,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:40:40,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:40:40,348 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 18 [2024-11-19 06:40:40,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:40:40,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:40,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:40:40,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:40:40,531 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:40:40,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:40:40,552 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:40:40,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2024-11-19 06:40:40,712 INFO L349 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2024-11-19 06:40:40,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 61 [2024-11-19 06:40:40,739 INFO L349 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2024-11-19 06:40:40,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2024-11-19 06:40:40,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:40:40,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-19 06:40:40,838 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 31 treesize of output 30 [2024-11-19 06:40:40,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-19 06:40:40,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-19 06:40:40,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-19 06:40:40,934 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-19 06:40:40,934 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 43 treesize of output 50 [2024-11-19 06:40:40,949 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-19 06:40:40,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-19 06:40:41,323 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:40:41,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 24 [2024-11-19 06:40:41,328 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:40:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:41,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:55,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2494 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2500 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse4 v_ArrVal_2494)))) (let ((.cse0 (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1))) (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| .cse0) .cse1 v_ArrVal_2500) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse2 |ULTIMATE.start_main_~y~0#1.base| .cse0) .cse1 v_ArrVal_2500) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2493 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 (select v_ArrVal_2493 .cse4)) v_ArrVal_2493)) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2498 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2493))) (let ((.cse5 (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) 0 (select v_ArrVal_2493 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (store (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base| .cse5) .cse1 v_ArrVal_2498) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse6 |ULTIMATE.start_main_~y~0#1.base| .cse5) .cse1 v_ArrVal_2498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) |ULTIMATE.start_main_~y~0#1.base|) 0)))))))) is different from false [2024-11-19 06:40:55,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2494 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2500 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_2494)))) (let ((.cse0 (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1))) (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~y~0#1.base| .cse0) .cse1 v_ArrVal_2500) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse2 |ULTIMATE.start_main_~y~0#1.base| .cse0) .cse1 v_ArrVal_2500) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2493 (Array Int Int))) (or (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 (select v_ArrVal_2493 .cse4)) .cse5 (select v_ArrVal_2493 .cse5)) v_ArrVal_2493)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2493))) (let ((.cse6 (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 (select v_ArrVal_2493 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (store (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~y~0#1.base| .cse6) .cse1 v_ArrVal_2498) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse7 |ULTIMATE.start_main_~y~0#1.base| .cse6) .cse1 v_ArrVal_2498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) |ULTIMATE.start_main_~y~0#1.base|) 0))))))) is different from false [2024-11-19 06:40:55,791 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 50 treesize of output 48 [2024-11-19 06:40:55,800 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 18 treesize of output 16 [2024-11-19 06:40:55,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:55,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 6 [2024-11-19 06:40:55,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-19 06:40:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026317687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:55,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 44 [2024-11-19 06:40:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478631743] [2024-11-19 06:40:55,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 06:40:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 06:40:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1450, Unknown=81, NotChecked=162, Total=1892 [2024-11-19 06:40:55,848 INFO L87 Difference]: Start difference. First operand 216 states and 272 transitions. Second operand has 44 states, 44 states have (on average 2.7045454545454546) internal successors, (119), 44 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)