./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.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/memsafety/lockfree-3.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:40:41,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:40:41,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:40:41,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:40:41,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:40:41,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:40:41,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:40:41,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:40:41,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:40:41,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:40:41,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:40:41,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:40:41,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:40:41,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:40:41,311 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:40:41,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:40:41,312 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:40:41,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:40:41,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:40:41,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:40:41,313 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:40:41,314 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:40:41,314 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:40:41,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:40:41,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:40:41,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:40:41,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:40:41,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:40:41,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:40:41,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:40:41,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:40:41,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:40:41,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:40:41,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:40:41,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:40:41,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:40:41,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:40:41,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:40:41,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:40:41,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:40:41,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:40:41,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:40:41,320 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2024-11-19 06:40:41,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:40:41,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:40:41,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:40:41,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:40:41,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:40:41,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-19 06:40:43,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:40:43,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:40:43,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-19 06:40:43,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1598cfaae/b25d791a466c4749834fac0ce7e4b934/FLAGe009bf39f [2024-11-19 06:40:43,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1598cfaae/b25d791a466c4749834fac0ce7e4b934 [2024-11-19 06:40:43,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:40:43,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:40:43,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:40:43,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:40:43,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:40:43,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:43,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d18fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43, skipping insertion in model container [2024-11-19 06:40:43,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:43,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:40:43,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:40:43,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:40:43,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:40:43,934 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:40:43,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43 WrapperNode [2024-11-19 06:40:43,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:40:43,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:40:43,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:40:43,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:40:43,944 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:40:43" (1/1) ... [2024-11-19 06:40:43,963 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:40:43" (1/1) ... [2024-11-19 06:40:43,989 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2024-11-19 06:40:43,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:40:43,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:40:43,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:40:43,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:40:44,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,039 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 06:40:44,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:40:44,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:40:44,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:40:44,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:40:44,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (1/1) ... [2024-11-19 06:40:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:40:44,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:44,117 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:40:44,120 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:40:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:40:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:40:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:40:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:40:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:40:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:40:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:40:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:40:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:40:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:40:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:40:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:40:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:40:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:40:44,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:40:44,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:40:44,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:40:44,614 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 06:40:44,614 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:40:44,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:40:44,633 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:40:44,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:40:44 BoogieIcfgContainer [2024-11-19 06:40:44,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:40:44,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:40:44,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:40:44,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:40:44,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:40:43" (1/3) ... [2024-11-19 06:40:44,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c19fc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:40:44, skipping insertion in model container [2024-11-19 06:40:44,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:43" (2/3) ... [2024-11-19 06:40:44,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c19fc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:40:44, skipping insertion in model container [2024-11-19 06:40:44,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:40:44" (3/3) ... [2024-11-19 06:40:44,641 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2024-11-19 06:40:44,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:40:44,655 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-19 06:40:44,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:40:44,702 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;@30289543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:40:44,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 06:40:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:40:44,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:44,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:40:44,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2024-11-19 06:40:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134365757] [2024-11-19 06:40:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:44,875 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:40:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134365757] [2024-11-19 06:40:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134365757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:44,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:40:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017123745] [2024-11-19 06:40:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:44,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:40:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:40:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:40:44,924 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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:40:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:44,943 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-19 06:40:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:40:44,945 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:40:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:44,954 INFO L225 Difference]: With dead ends: 64 [2024-11-19 06:40:44,954 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 06:40:44,956 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:40:44,961 INFO L432 NwaCegarLoop]: 81 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, 81 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:40:44,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 06:40:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-19 06:40:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-19 06:40:45,026 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2024-11-19 06:40:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:45,026 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-19 06:40:45,027 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:40:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-19 06:40:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:40:45,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:45,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:45,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:40:45,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:45,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2024-11-19 06:40:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577264769] [2024-11-19 06:40:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:45,117 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:40:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577264769] [2024-11-19 06:40:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577264769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:45,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:40:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467711522] [2024-11-19 06:40:45,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:45,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:40:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:45,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:40:45,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:40:45,121 INFO L87 Difference]: Start difference. First operand 62 states and 79 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:40:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:45,139 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-11-19 06:40:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:40:45,140 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:40:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:45,141 INFO L225 Difference]: With dead ends: 63 [2024-11-19 06:40:45,142 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 06:40:45,142 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:40:45,143 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:45,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 06:40:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-19 06:40:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-19 06:40:45,151 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2024-11-19 06:40:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:45,151 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-19 06:40:45,152 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:40:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-19 06:40:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:40:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:45,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:45,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:40:45,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2024-11-19 06:40:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:45,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154328647] [2024-11-19 06:40:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:45,266 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:40:45,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154328647] [2024-11-19 06:40:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154328647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:45,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:45,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:40:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810731302] [2024-11-19 06:40:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:45,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:40:45,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:40:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:40:45,269 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:40:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:45,313 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2024-11-19 06:40:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:40:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:40:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:45,316 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:40:45,319 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:40:45,320 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:40:45,321 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:45,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:40:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2024-11-19 06:40:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-19 06:40:45,338 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2024-11-19 06:40:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:45,339 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-19 06:40:45,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:40:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-19 06:40:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:40:45,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:45,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:45,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:40:45,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:45,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2024-11-19 06:40:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514663014] [2024-11-19 06:40:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:45,478 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:40:45,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514663014] [2024-11-19 06:40:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514663014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:45,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:40:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478379035] [2024-11-19 06:40:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:40:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:45,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:40:45,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:40:45,481 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.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:40:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:45,534 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2024-11-19 06:40:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:40:45,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.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:40:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:45,536 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:40:45,536 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:40:45,537 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:40:45,538 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:45,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:40:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-11-19 06:40:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-11-19 06:40:45,553 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2024-11-19 06:40:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:45,556 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-11-19 06:40:45,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.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:40:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-11-19 06:40:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:40:45,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:45,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:45,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:40:45,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:45,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2024-11-19 06:40:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053349899] [2024-11-19 06:40:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:45,609 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:40:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:45,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053349899] [2024-11-19 06:40:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053349899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:40:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423058506] [2024-11-19 06:40:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:45,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:40:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:40:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:40:45,615 INFO L87 Difference]: Start difference. First operand 95 states and 139 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:40:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:45,689 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2024-11-19 06:40:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:40:45,690 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:40:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:45,691 INFO L225 Difference]: With dead ends: 177 [2024-11-19 06:40:45,692 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 06:40:45,692 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:40:45,693 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:45,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 06:40:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2024-11-19 06:40:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2024-11-19 06:40:45,714 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2024-11-19 06:40:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:45,717 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2024-11-19 06:40:45,717 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:40:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2024-11-19 06:40:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:40:45,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:45,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:45,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:40:45,719 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2024-11-19 06:40:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:45,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988124413] [2024-11-19 06:40:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:45,815 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:40:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988124413] [2024-11-19 06:40:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988124413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:45,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:45,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:40:45,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987712437] [2024-11-19 06:40:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:45,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:40:45,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:40:45,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:40:45,819 INFO L87 Difference]: Start difference. First operand 153 states and 246 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:40:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:45,914 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2024-11-19 06:40:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:40:45,916 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:40:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:45,917 INFO L225 Difference]: With dead ends: 229 [2024-11-19 06:40:45,917 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 06:40:45,917 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:40:45,918 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:45,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 06:40:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 208. [2024-11-19 06:40:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2024-11-19 06:40:45,949 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2024-11-19 06:40:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:45,949 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2024-11-19 06:40:45,949 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:40:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2024-11-19 06:40:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:40:45,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:45,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:45,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:40:45,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:45,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2024-11-19 06:40:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351419776] [2024-11-19 06:40:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:46,081 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:40:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351419776] [2024-11-19 06:40:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351419776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:46,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:46,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:40:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680059951] [2024-11-19 06:40:46,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:46,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:40:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:40:46,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:40:46,099 INFO L87 Difference]: Start difference. First operand 208 states and 340 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:40:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:46,161 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2024-11-19 06:40:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:40:46,161 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:40:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:46,163 INFO L225 Difference]: With dead ends: 224 [2024-11-19 06:40:46,163 INFO L226 Difference]: Without dead ends: 224 [2024-11-19 06:40:46,163 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:40:46,165 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:46,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-19 06:40:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2024-11-19 06:40:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2024-11-19 06:40:46,175 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2024-11-19 06:40:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2024-11-19 06:40:46,176 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:40:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2024-11-19 06:40:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:40:46,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:46,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:40:46,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2024-11-19 06:40:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027604585] [2024-11-19 06:40:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:46,235 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:40:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:46,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027604585] [2024-11-19 06:40:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027604585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:40:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889882975] [2024-11-19 06:40:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:46,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:40:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:46,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:40:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:40:46,240 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:46,271 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 06:40:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:40:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:40:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:46,273 INFO L225 Difference]: With dead ends: 186 [2024-11-19 06:40:46,273 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 06:40:46,273 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:40:46,276 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:46,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 196 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 06:40:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2024-11-19 06:40:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.6821192052980132) internal successors, (254), 162 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2024-11-19 06:40:46,290 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 9 [2024-11-19 06:40:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:46,291 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2024-11-19 06:40:46,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2024-11-19 06:40:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:40:46,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:46,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:46,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:40:46,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:46,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2024-11-19 06:40:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236455677] [2024-11-19 06:40:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:46,363 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:40:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:46,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236455677] [2024-11-19 06:40:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236455677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:40:46,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:40:46,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:40:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883116872] [2024-11-19 06:40:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:46,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:40:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:40:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:40:46,370 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:46,399 INFO L93 Difference]: Finished difference Result 250 states and 372 transitions. [2024-11-19 06:40:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:40:46,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-19 06:40:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:46,404 INFO L225 Difference]: With dead ends: 250 [2024-11-19 06:40:46,404 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 06:40:46,404 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:40:46,405 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:46,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 06:40:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-11-19 06:40:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 233 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2024-11-19 06:40:46,417 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 10 [2024-11-19 06:40:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2024-11-19 06:40:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2024-11-19 06:40:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:40:46,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:46,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:46,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:40:46,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:46,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2024-11-19 06:40:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151294059] [2024-11-19 06:40:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:46,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:46,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151294059] [2024-11-19 06:40:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151294059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633423843] [2024-11-19 06:40:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:46,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:46,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:46,527 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:40:46,528 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:40:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:46,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:40:46,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:46,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633423843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:46,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 06:40:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432500243] [2024-11-19 06:40:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:46,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:40:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:46,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:40:46,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:40:46,742 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:40:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:46,783 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2024-11-19 06:40:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:40:46,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 16 [2024-11-19 06:40:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:46,784 INFO L225 Difference]: With dead ends: 238 [2024-11-19 06:40:46,784 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 06:40:46,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:40:46,785 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 139 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:46,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 289 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 06:40:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2024-11-19 06:40:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 218 states have (on average 1.5779816513761469) internal successors, (344), 229 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 344 transitions. [2024-11-19 06:40:46,792 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 344 transitions. Word has length 16 [2024-11-19 06:40:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:46,793 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 344 transitions. [2024-11-19 06:40:46,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:40:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2024-11-19 06:40:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:40:46,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:46,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:46,814 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:40:46,996 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,SelfDestructingSolverStorable9 [2024-11-19 06:40:46,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2024-11-19 06:40:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:46,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372479990] [2024-11-19 06:40:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372479990] [2024-11-19 06:40:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372479990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595970406] [2024-11-19 06:40:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:47,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:47,127 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:40:47,129 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:40:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:47,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:40:47,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:47,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595970406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:47,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-19 06:40:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586715242] [2024-11-19 06:40:47,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:40:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:40:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:40:47,286 INFO L87 Difference]: Start difference. First operand 230 states and 344 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 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:40:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:47,352 INFO L93 Difference]: Finished difference Result 373 states and 532 transitions. [2024-11-19 06:40:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:40:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 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 16 [2024-11-19 06:40:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:47,355 INFO L225 Difference]: With dead ends: 373 [2024-11-19 06:40:47,355 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 06:40:47,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:40:47,356 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 90 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:47,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 346 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 06:40:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 323. [2024-11-19 06:40:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.5305466237942122) internal successors, (476), 322 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2024-11-19 06:40:47,363 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 16 [2024-11-19 06:40:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:47,363 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2024-11-19 06:40:47,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 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:40:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2024-11-19 06:40:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:40:47,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:47,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:47,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:40:47,565 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,SelfDestructingSolverStorable10 [2024-11-19 06:40:47,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1134377974, now seen corresponding path program 2 times [2024-11-19 06:40:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692647834] [2024-11-19 06:40:47,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:40:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:47,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:40:47,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:40:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:40:47,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:47,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692647834] [2024-11-19 06:40:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692647834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:47,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086601671] [2024-11-19 06:40:47,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:40:47,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:47,643 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:40:47,644 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:40:47,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:40:47,715 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:40:47,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:40:47,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:47,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086601671] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:47,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-11-19 06:40:47,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617201618] [2024-11-19 06:40:47,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:47,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:40:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:40:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:40:47,808 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 8 states, 8 states have (on average 5.125) 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:40:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:47,933 INFO L93 Difference]: Finished difference Result 373 states and 520 transitions. [2024-11-19 06:40:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:40:47,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) 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 22 [2024-11-19 06:40:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:47,935 INFO L225 Difference]: With dead ends: 373 [2024-11-19 06:40:47,935 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 06:40:47,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:40:47,936 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 253 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:47,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 446 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 06:40:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 323. [2024-11-19 06:40:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.4919614147909968) internal successors, (464), 322 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 464 transitions. [2024-11-19 06:40:47,943 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 464 transitions. Word has length 22 [2024-11-19 06:40:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:47,943 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 464 transitions. [2024-11-19 06:40:47,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) 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:40:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 464 transitions. [2024-11-19 06:40:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:40:47,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:47,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:47,961 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:40:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:48,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2024-11-19 06:40:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811275911] [2024-11-19 06:40:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:48,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811275911] [2024-11-19 06:40:48,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811275911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24043688] [2024-11-19 06:40:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:48,253 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:40:48,255 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:40:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:48,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:40:48,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:48,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24043688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:48,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:40:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720881952] [2024-11-19 06:40:48,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:48,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:40:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:40:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:40:48,463 INFO L87 Difference]: Start difference. First operand 323 states and 464 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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:40:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:48,543 INFO L93 Difference]: Finished difference Result 932 states and 1332 transitions. [2024-11-19 06:40:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:40:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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:40:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:48,548 INFO L225 Difference]: With dead ends: 932 [2024-11-19 06:40:48,549 INFO L226 Difference]: Without dead ends: 932 [2024-11-19 06:40:48,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:48,549 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 176 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:48,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 165 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-19 06:40:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 811. [2024-11-19 06:40:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 799 states have (on average 1.4793491864831039) internal successors, (1182), 810 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states 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:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1182 transitions. [2024-11-19 06:40:48,567 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1182 transitions. Word has length 24 [2024-11-19 06:40:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:48,569 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1182 transitions. [2024-11-19 06:40:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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:40:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1182 transitions. [2024-11-19 06:40:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:40:48,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:48,570 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:48,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:40:48,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:48,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:48,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:48,774 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2024-11-19 06:40:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:48,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399763136] [2024-11-19 06:40:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:48,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:48,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:48,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399763136] [2024-11-19 06:40:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399763136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:48,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538354387] [2024-11-19 06:40:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:48,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:48,883 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:40:48,884 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:40:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:48,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:40:48,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:49,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538354387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:49,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 06:40:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406377190] [2024-11-19 06:40:49,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:49,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:40:49,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:40:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:40:49,073 INFO L87 Difference]: Start difference. First operand 811 states and 1182 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:49,208 INFO L93 Difference]: Finished difference Result 2047 states and 2834 transitions. [2024-11-19 06:40:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:40:49,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:40:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:49,216 INFO L225 Difference]: With dead ends: 2047 [2024-11-19 06:40:49,217 INFO L226 Difference]: Without dead ends: 2047 [2024-11-19 06:40:49,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:40:49,218 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 200 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:49,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 405 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2024-11-19 06:40:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1879. [2024-11-19 06:40:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1867 states have (on average 1.432244242099625) internal successors, (2674), 1878 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states 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:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2674 transitions. [2024-11-19 06:40:49,255 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2674 transitions. Word has length 27 [2024-11-19 06:40:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2674 transitions. [2024-11-19 06:40:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2674 transitions. [2024-11-19 06:40:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:40:49,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:49,257 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:49,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:40:49,461 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,SelfDestructingSolverStorable13 [2024-11-19 06:40:49,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2024-11-19 06:40:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577085390] [2024-11-19 06:40:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:40:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577085390] [2024-11-19 06:40:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577085390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968902356] [2024-11-19 06:40:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:49,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:49,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:49,559 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:40:49,560 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:40:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:49,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:40:49,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:40:49,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:40:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968902356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:49,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-19 06:40:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967141141] [2024-11-19 06:40:49,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:49,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:40:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:40:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:40:49,693 INFO L87 Difference]: Start difference. First operand 1879 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:49,747 INFO L93 Difference]: Finished difference Result 945 states and 1296 transitions. [2024-11-19 06:40:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:40:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:40:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:49,751 INFO L225 Difference]: With dead ends: 945 [2024-11-19 06:40:49,751 INFO L226 Difference]: Without dead ends: 945 [2024-11-19 06:40:49,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:40:49,752 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:49,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 427 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:40:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-19 06:40:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 885. [2024-11-19 06:40:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 873 states have (on average 1.404352806414662) internal successors, (1226), 884 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states 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:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1226 transitions. [2024-11-19 06:40:49,766 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1226 transitions. Word has length 27 [2024-11-19 06:40:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:49,766 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1226 transitions. [2024-11-19 06:40:49,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:40:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1226 transitions. [2024-11-19 06:40:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:40:49,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:49,768 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:49,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:40:49,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 06:40:49,969 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:49,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2024-11-19 06:40:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:49,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245440934] [2024-11-19 06:40:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 06:40:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245440934] [2024-11-19 06:40:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245440934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681569723] [2024-11-19 06:40:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:50,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:50,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:50,183 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:40:50,184 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:40:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:50,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:40:50,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:50,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681569723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:50,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2024-11-19 06:40:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522488309] [2024-11-19 06:40:50,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:50,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:40:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:40:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:40:50,520 INFO L87 Difference]: Start difference. First operand 885 states and 1226 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:50,816 INFO L93 Difference]: Finished difference Result 1662 states and 2224 transitions. [2024-11-19 06:40:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 06:40:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-19 06:40:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:50,822 INFO L225 Difference]: With dead ends: 1662 [2024-11-19 06:40:50,822 INFO L226 Difference]: Without dead ends: 1662 [2024-11-19 06:40:50,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:40:50,823 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 435 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:50,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 746 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-19 06:40:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 984. [2024-11-19 06:40:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 972 states have (on average 1.4207818930041152) internal successors, (1381), 983 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states 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:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1381 transitions. [2024-11-19 06:40:50,843 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1381 transitions. Word has length 51 [2024-11-19 06:40:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:50,843 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1381 transitions. [2024-11-19 06:40:50,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1381 transitions. [2024-11-19 06:40:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 06:40:50,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:50,845 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:50,862 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:40:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:51,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:51,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2024-11-19 06:40:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840495178] [2024-11-19 06:40:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 06:40:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840495178] [2024-11-19 06:40:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840495178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162600738] [2024-11-19 06:40:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:51,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:51,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:51,184 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:40:51,186 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:40:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:51,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:40:51,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:40:51,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:40:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162600738] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:40:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2024-11-19 06:40:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077398153] [2024-11-19 06:40:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:40:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:40:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:40:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:40:51,420 INFO L87 Difference]: Start difference. First operand 984 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:51,511 INFO L93 Difference]: Finished difference Result 1692 states and 2316 transitions. [2024-11-19 06:40:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:40:51,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 59 [2024-11-19 06:40:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:51,517 INFO L225 Difference]: With dead ends: 1692 [2024-11-19 06:40:51,517 INFO L226 Difference]: Without dead ends: 1692 [2024-11-19 06:40:51,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:40:51,518 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 137 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:51,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 287 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2024-11-19 06:40:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1632. [2024-11-19 06:40:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1620 states have (on average 1.3962962962962964) internal successors, (2262), 1631 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states 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:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2262 transitions. [2024-11-19 06:40:51,565 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2262 transitions. Word has length 59 [2024-11-19 06:40:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:51,565 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2262 transitions. [2024-11-19 06:40:51,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2262 transitions. [2024-11-19 06:40:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 06:40:51,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:51,567 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 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:40:51,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:40:51,767 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,SelfDestructingSolverStorable16 [2024-11-19 06:40:51,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:51,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2024-11-19 06:40:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116448919] [2024-11-19 06:40:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-19 06:40:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116448919] [2024-11-19 06:40:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116448919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583332631] [2024-11-19 06:40:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:51,875 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:40:51,876 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:40:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:51,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:40:51,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 06:40:52,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 06:40:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583332631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:52,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:52,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2024-11-19 06:40:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493706345] [2024-11-19 06:40:52,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:52,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:40:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:52,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:40:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:40:52,079 INFO L87 Difference]: Start difference. First operand 1632 states and 2262 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:53,200 INFO L93 Difference]: Finished difference Result 6679 states and 9136 transitions. [2024-11-19 06:40:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 06:40:53,201 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 59 [2024-11-19 06:40:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:53,224 INFO L225 Difference]: With dead ends: 6679 [2024-11-19 06:40:53,224 INFO L226 Difference]: Without dead ends: 6679 [2024-11-19 06:40:53,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:40:53,226 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 448 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:53,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 655 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:40:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-11-19 06:40:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 4625. [2024-11-19 06:40:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4614 states have (on average 1.4195925444299957) internal successors, (6550), 4624 states have internal predecessors, (6550), 0 states have call successors, (0), 0 states 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:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6550 transitions. [2024-11-19 06:40:53,330 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6550 transitions. Word has length 59 [2024-11-19 06:40:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:53,330 INFO L471 AbstractCegarLoop]: Abstraction has 4625 states and 6550 transitions. [2024-11-19 06:40:53,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6550 transitions. [2024-11-19 06:40:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 06:40:53,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:53,333 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:53,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:40:53,536 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,SelfDestructingSolverStorable17 [2024-11-19 06:40:53,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:53,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2024-11-19 06:40:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756547290] [2024-11-19 06:40:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 06:40:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756547290] [2024-11-19 06:40:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756547290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209750647] [2024-11-19 06:40:53,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:53,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:53,732 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:40:53,733 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:40:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:53,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:40:53,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:40:53,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:40:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209750647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:53,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-19 06:40:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019366936] [2024-11-19 06:40:53,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:40:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:40:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:40:53,999 INFO L87 Difference]: Start difference. First operand 4625 states and 6550 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:54,489 INFO L93 Difference]: Finished difference Result 7302 states and 10007 transitions. [2024-11-19 06:40:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 06:40:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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 63 [2024-11-19 06:40:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:54,515 INFO L225 Difference]: With dead ends: 7302 [2024-11-19 06:40:54,515 INFO L226 Difference]: Without dead ends: 7302 [2024-11-19 06:40:54,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 06:40:54,517 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 268 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:54,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 946 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2024-11-19 06:40:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 4425. [2024-11-19 06:40:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4414 states have (on average 1.3948799275033983) internal successors, (6157), 4424 states have internal predecessors, (6157), 0 states have call successors, (0), 0 states 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:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6157 transitions. [2024-11-19 06:40:54,653 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6157 transitions. Word has length 63 [2024-11-19 06:40:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:54,654 INFO L471 AbstractCegarLoop]: Abstraction has 4425 states and 6157 transitions. [2024-11-19 06:40:54,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6157 transitions. [2024-11-19 06:40:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 06:40:54,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:54,655 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 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:40:54,674 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:54,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:54,857 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:54,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2024-11-19 06:40:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522788634] [2024-11-19 06:40:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:40:55,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:40:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522788634] [2024-11-19 06:40:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522788634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:40:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763365734] [2024-11-19 06:40:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:40:55,023 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:55,024 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:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:40:55,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:40:55,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:40:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 06:40:55,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 06:40:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763365734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:40:55,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:40:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-19 06:40:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297964601] [2024-11-19 06:40:55,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:40:55,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:40:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:40:55,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:40:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:40:55,295 INFO L87 Difference]: Start difference. First operand 4425 states and 6157 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:40:55,539 INFO L93 Difference]: Finished difference Result 2959 states and 3823 transitions. [2024-11-19 06:40:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:40:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 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 63 [2024-11-19 06:40:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:40:55,548 INFO L225 Difference]: With dead ends: 2959 [2024-11-19 06:40:55,549 INFO L226 Difference]: Without dead ends: 2959 [2024-11-19 06:40:55,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:40:55,550 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 338 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:40:55,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1373 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:40:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2024-11-19 06:40:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2865. [2024-11-19 06:40:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3135949544498948) internal successors, (3749), 2864 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states 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:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3749 transitions. [2024-11-19 06:40:55,607 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3749 transitions. Word has length 63 [2024-11-19 06:40:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:40:55,607 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 3749 transitions. [2024-11-19 06:40:55,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3749 transitions. [2024-11-19 06:40:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 06:40:55,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:40:55,609 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:55,627 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:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:40:55,813 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:40:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:40:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2024-11-19 06:40:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:40:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932940175] [2024-11-19 06:40:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:40:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:40:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:40:55,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:40:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:40:55,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:40:55,888 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:40:55,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-19 06:40:55,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-19 06:40:55,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-19 06:40:55,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-19 06:40:55,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-19 06:40:55,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-19 06:40:55,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-19 06:40:55,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-19 06:40:55,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:40:55,897 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:40:55,980 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:40:55,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:40:55 BoogieIcfgContainer [2024-11-19 06:40:55,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:40:55,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:40:55,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:40:55,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:40:55,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:40:44" (3/4) ... [2024-11-19 06:40:55,989 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 06:40:55,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:40:55,991 INFO L158 Benchmark]: Toolchain (without parser) took 12575.31ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 76.2MB in the beginning and 135.8MB in the end (delta: -59.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,991 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:40:55,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.01ms. Allocated memory is still 146.8MB. Free memory was 76.1MB in the beginning and 102.0MB in the end (delta: -25.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.08ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 100.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,992 INFO L158 Benchmark]: Boogie Preprocessor took 79.27ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 97.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,995 INFO L158 Benchmark]: RCFGBuilder took 561.01ms. Allocated memory is still 146.8MB. Free memory was 97.3MB in the beginning and 77.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,995 INFO L158 Benchmark]: TraceAbstraction took 11350.83ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 76.9MB in the beginning and 136.9MB in the end (delta: -59.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,996 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 220.2MB. Free memory was 136.9MB in the beginning and 135.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:40:55,997 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.01ms. Allocated memory is still 146.8MB. Free memory was 76.1MB in the beginning and 102.0MB in the end (delta: -25.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.08ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 100.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.27ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 97.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.01ms. Allocated memory is still 146.8MB. Free memory was 97.3MB in the beginning and 77.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11350.83ms. Allocated memory was 146.8MB in the beginning and 220.2MB in the end (delta: 73.4MB). Free memory was 76.9MB in the beginning and 136.9MB in the end (delta: -59.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 220.2MB. Free memory was 136.9MB in the beginning and 135.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L545] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L552] S = x1 VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2913 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2913 mSDsluCounter, 7529 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5681 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1903 IncrementalHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 1848 mSDtfsCounter, 1903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1077 GetRequests, 840 SyntacticMatches, 14 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4625occurred in iteration=18, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 6343 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 2980 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2035 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 1487/1857 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 06:40:56,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:40:58,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:40:58,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:40:58,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:40:58,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:40:58,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:40:58,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:40:58,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:40:58,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:40:58,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:40:58,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:40:58,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:40:58,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:40:58,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:40:58,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:40:58,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:40:58,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:40:58,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:40:58,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:40:58,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:40:58,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:40:58,416 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:40:58,416 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:40:58,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:40:58,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:40:58,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:40:58,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:40:58,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:40:58,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:40:58,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:40:58,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:40:58,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:40:58,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:40:58,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:40:58,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:40:58,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:40:58,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:40:58,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:40:58,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:40:58,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:40:58,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:40:58,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:40:58,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:40:58,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:40:58,422 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2024-11-19 06:40:58,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:40:58,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:40:58,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:40:58,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:40:58,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:40:58,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-19 06:41:00,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:41:00,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:41:00,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2024-11-19 06:41:00,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e564cdf/49d465054a784c59814d172ea528d989/FLAGe5a23cdda [2024-11-19 06:41:00,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e564cdf/49d465054a784c59814d172ea528d989 [2024-11-19 06:41:00,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:41:00,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:41:00,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:00,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:41:00,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:41:00,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:00" (1/1) ... [2024-11-19 06:41:00,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4203def3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:00, skipping insertion in model container [2024-11-19 06:41:00,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:00" (1/1) ... [2024-11-19 06:41:00,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:01,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:01,383 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:41:01,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:01,479 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:41:01,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01 WrapperNode [2024-11-19 06:41:01,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:01,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:01,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:41:01,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:41:01,487 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:41:01" (1/1) ... [2024-11-19 06:41:01,509 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:41:01" (1/1) ... [2024-11-19 06:41:01,535 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-11-19 06:41:01,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:01,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:41:01,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:41:01,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:41:01,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,593 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 06:41:01,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:41:01,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:41:01,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:41:01,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:41:01,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (1/1) ... [2024-11-19 06:41:01,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:01,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:01,673 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:41:01,676 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:41:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:41:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:41:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:41:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:41:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:41:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:41:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:41:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:41:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:41:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:41:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:41:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:41:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:41:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:41:01,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:41:01,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:41:01,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:41:02,255 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 06:41:02,255 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:41:02,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:41:02,271 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:41:02,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:02 BoogieIcfgContainer [2024-11-19 06:41:02,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:41:02,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:41:02,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:41:02,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:41:02,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:41:00" (1/3) ... [2024-11-19 06:41:02,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:02, skipping insertion in model container [2024-11-19 06:41:02,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:01" (2/3) ... [2024-11-19 06:41:02,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:02, skipping insertion in model container [2024-11-19 06:41:02,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:02" (3/3) ... [2024-11-19 06:41:02,283 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2024-11-19 06:41:02,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:41:02,303 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-19 06:41:02,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:41:02,368 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;@7870c6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:41:02,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 06:41:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:41:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:41:02,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:02,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:41:02,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2024-11-19 06:41:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:02,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750645807] [2024-11-19 06:41:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:02,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:02,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:41:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:02,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:41:02,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:02,529 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:41:02,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:02,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:02,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750645807] [2024-11-19 06:41:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750645807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:02,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:02,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121424299] [2024-11-19 06:41:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:02,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:41:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:41:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:02,597 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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:41:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:02,610 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-19 06:41:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:41:02,612 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:41:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:02,618 INFO L225 Difference]: With dead ends: 64 [2024-11-19 06:41:02,619 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 06:41:02,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:41:02,623 INFO L432 NwaCegarLoop]: 81 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, 81 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:41:02,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 06:41:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-19 06:41:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:41:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-19 06:41:02,655 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2024-11-19 06:41:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:02,655 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-19 06:41:02,655 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:41:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-19 06:41:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:02,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:02,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:02,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:02,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:02,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:02,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2024-11-19 06:41:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445467262] [2024-11-19 06:41:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:02,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:02,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:02,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:41:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:02,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:41:02,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:03,012 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:41:03,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:03,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445467262] [2024-11-19 06:41:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445467262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040503774] [2024-11-19 06:41:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:03,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:03,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:03,016 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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:41:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:03,104 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2024-11-19 06:41:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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:41:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:03,107 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:41:03,107 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:41:03,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:41:03,109 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:03,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:41:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2024-11-19 06:41:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 63 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:41:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2024-11-19 06:41:03,119 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 7 [2024-11-19 06:41:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:03,119 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-11-19 06:41:03,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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:41:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2024-11-19 06:41:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:03,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:03,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:03,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:41:03,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:03,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:03,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2024-11-19 06:41:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634074283] [2024-11-19 06:41:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:03,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:03,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:03,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:41:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:03,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:41:03,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:03,441 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:41:03,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:03,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634074283] [2024-11-19 06:41:03,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634074283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:03,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:03,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269098488] [2024-11-19 06:41:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:03,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:03,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:03,444 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:41:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:03,500 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2024-11-19 06:41:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:03,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:41:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:03,502 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:41:03,503 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:41:03,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:41:03,504 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:03,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:41:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2024-11-19 06:41:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-19 06:41:03,514 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2024-11-19 06:41:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:03,515 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-19 06:41:03,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:41:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-19 06:41:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:41:03,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:03,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:03,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:03,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:03,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:03,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2024-11-19 06:41:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:03,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997205586] [2024-11-19 06:41:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:03,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:03,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:03,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:03,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:41:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:03,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:41:03,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:03,784 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:41:03,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:03,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:03,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997205586] [2024-11-19 06:41:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997205586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:03,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:03,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538175511] [2024-11-19 06:41:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:03,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:03,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:03,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:03,788 INFO L87 Difference]: Start difference. First operand 93 states and 137 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:41:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:03,897 INFO L93 Difference]: Finished difference Result 173 states and 257 transitions. [2024-11-19 06:41:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:03,897 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:41:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:03,899 INFO L225 Difference]: With dead ends: 173 [2024-11-19 06:41:03,899 INFO L226 Difference]: Without dead ends: 170 [2024-11-19 06:41:03,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:41:03,901 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:03,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-19 06:41:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2024-11-19 06:41:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.8692307692307693) internal successors, (243), 149 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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:41:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 243 transitions. [2024-11-19 06:41:03,914 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 243 transitions. Word has length 8 [2024-11-19 06:41:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:03,914 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 243 transitions. [2024-11-19 06:41:03,914 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:41:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 243 transitions. [2024-11-19 06:41:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:41:03,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:03,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:03,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:41:04,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:04,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:04,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2024-11-19 06:41:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110728333] [2024-11-19 06:41:04,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:04,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:04,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:04,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:41:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:04,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:41:04,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:04,284 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 7 [2024-11-19 06:41:04,300 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:41:04,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:04,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110728333] [2024-11-19 06:41:04,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110728333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:04,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:04,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508780880] [2024-11-19 06:41:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:04,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:04,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:04,305 INFO L87 Difference]: Start difference. First operand 150 states and 243 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:41:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:04,435 INFO L93 Difference]: Finished difference Result 225 states and 350 transitions. [2024-11-19 06:41:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:04,436 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:41:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:04,437 INFO L225 Difference]: With dead ends: 225 [2024-11-19 06:41:04,438 INFO L226 Difference]: Without dead ends: 225 [2024-11-19 06:41:04,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:41:04,439 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:04,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-19 06:41:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 204. [2024-11-19 06:41:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 186 states have (on average 1.8064516129032258) internal successors, (336), 203 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:41:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 336 transitions. [2024-11-19 06:41:04,459 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 336 transitions. Word has length 8 [2024-11-19 06:41:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:04,460 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 336 transitions. [2024-11-19 06:41:04,460 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:41:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 336 transitions. [2024-11-19 06:41:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:41:04,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:04,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:04,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:41:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:04,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2024-11-19 06:41:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724171016] [2024-11-19 06:41:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:04,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:04,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:04,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:04,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:41:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:04,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:41:04,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:04,752 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:41:04,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:41:04,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:04,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724171016] [2024-11-19 06:41:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724171016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710979511] [2024-11-19 06:41:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:04,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:04,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:04,765 INFO L87 Difference]: Start difference. First operand 204 states and 336 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:41:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:04,898 INFO L93 Difference]: Finished difference Result 220 states and 341 transitions. [2024-11-19 06:41:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:04,899 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:41:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:04,900 INFO L225 Difference]: With dead ends: 220 [2024-11-19 06:41:04,902 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 06:41:04,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:41:04,903 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:04,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 06:41:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 202. [2024-11-19 06:41:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 186 states have (on average 1.7634408602150538) internal successors, (328), 201 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:41:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 328 transitions. [2024-11-19 06:41:04,926 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 328 transitions. Word has length 8 [2024-11-19 06:41:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:04,926 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 328 transitions. [2024-11-19 06:41:04,930 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:41:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 328 transitions. [2024-11-19 06:41:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:41:04,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:04,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:04,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:41:05,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:05,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:05,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2024-11-19 06:41:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760047248] [2024-11-19 06:41:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:05,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:05,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:05,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:05,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:41:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:05,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:41:05,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:05,216 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:41:05,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:05,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:05,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760047248] [2024-11-19 06:41:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760047248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:05,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218867708] [2024-11-19 06:41:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:05,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:05,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:05,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:05,220 INFO L87 Difference]: Start difference. First operand 202 states and 328 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:05,251 INFO L93 Difference]: Finished difference Result 181 states and 266 transitions. [2024-11-19 06:41:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:41:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:05,253 INFO L225 Difference]: With dead ends: 181 [2024-11-19 06:41:05,253 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 06:41:05,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:41:05,254 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:05,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 196 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 06:41:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 158. [2024-11-19 06:41:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.7054794520547945) internal successors, (249), 157 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:41:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 249 transitions. [2024-11-19 06:41:05,262 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 249 transitions. Word has length 9 [2024-11-19 06:41:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:05,262 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 249 transitions. [2024-11-19 06:41:05,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 249 transitions. [2024-11-19 06:41:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:41:05,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:05,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:05,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:41:05,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:05,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2024-11-19 06:41:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035645411] [2024-11-19 06:41:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:05,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:05,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:05,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:05,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:41:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:05,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:41:05,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:05,536 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:41:05,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:05,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:05,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035645411] [2024-11-19 06:41:05,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035645411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:05,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117600420] [2024-11-19 06:41:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:05,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:05,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:05,539 INFO L87 Difference]: Start difference. First operand 158 states and 249 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:41:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:05,578 INFO L93 Difference]: Finished difference Result 240 states and 362 transitions. [2024-11-19 06:41:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:05,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-19 06:41:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:05,581 INFO L225 Difference]: With dead ends: 240 [2024-11-19 06:41:05,581 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 06:41:05,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:41:05,582 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:05,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 06:41:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2024-11-19 06:41:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 212 states have (on average 1.6320754716981132) internal successors, (346), 223 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:41:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 346 transitions. [2024-11-19 06:41:05,597 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 346 transitions. Word has length 10 [2024-11-19 06:41:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 346 transitions. [2024-11-19 06:41:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:41:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 346 transitions. [2024-11-19 06:41:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:41:05,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:05,598 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:05,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 06:41:05,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:05,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 20399352, now seen corresponding path program 1 times [2024-11-19 06:41:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:05,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137505432] [2024-11-19 06:41:05,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:05,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:05,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:05,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:05,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:41:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:05,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:41:05,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:05,936 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:41:05,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:05,982 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:41:05,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137505432] [2024-11-19 06:41:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137505432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:05,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:05,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 06:41:05,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497516326] [2024-11-19 06:41:05,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:05,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:05,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:05,985 INFO L87 Difference]: Start difference. First operand 224 states and 346 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:06,093 INFO L93 Difference]: Finished difference Result 529 states and 761 transitions. [2024-11-19 06:41:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:41:06,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:41:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:06,096 INFO L225 Difference]: With dead ends: 529 [2024-11-19 06:41:06,096 INFO L226 Difference]: Without dead ends: 529 [2024-11-19 06:41:06,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:41:06,097 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 280 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:06,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 432 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-19 06:41:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 488. [2024-11-19 06:41:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 476 states have (on average 1.5630252100840336) internal successors, (744), 487 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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:41:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 744 transitions. [2024-11-19 06:41:06,112 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 744 transitions. Word has length 16 [2024-11-19 06:41:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:06,112 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 744 transitions. [2024-11-19 06:41:06,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 744 transitions. [2024-11-19 06:41:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:41:06,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:06,114 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:06,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:06,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:06,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:06,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2024-11-19 06:41:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:06,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097438012] [2024-11-19 06:41:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:06,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:06,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:06,317 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:06,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:41:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:06,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:41:06,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:06,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:06,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097438012] [2024-11-19 06:41:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097438012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:06,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-19 06:41:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668303787] [2024-11-19 06:41:06,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:06,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:06,449 INFO L87 Difference]: Start difference. First operand 488 states and 744 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:41:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:06,524 INFO L93 Difference]: Finished difference Result 733 states and 1078 transitions. [2024-11-19 06:41:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-19 06:41:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:06,529 INFO L225 Difference]: With dead ends: 733 [2024-11-19 06:41:06,529 INFO L226 Difference]: Without dead ends: 733 [2024-11-19 06:41:06,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:41:06,530 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:06,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 432 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-19 06:41:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 665. [2024-11-19 06:41:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 653 states have (on average 1.5283307810107198) internal successors, (998), 664 states have internal predecessors, (998), 0 states have call successors, (0), 0 states 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:41:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 998 transitions. [2024-11-19 06:41:06,551 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 998 transitions. Word has length 16 [2024-11-19 06:41:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:06,551 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 998 transitions. [2024-11-19 06:41:06,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:41:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 998 transitions. [2024-11-19 06:41:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:41:06,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:06,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:06,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:41:06,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:06,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:06,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1134377974, now seen corresponding path program 2 times [2024-11-19 06:41:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6440198] [2024-11-19 06:41:06,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:41:06,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:06,755 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:06,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:41:06,806 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:41:06,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:41:06,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:41:06,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:06,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:06,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:06,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6440198] [2024-11-19 06:41:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6440198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:06,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 06:41:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204299529] [2024-11-19 06:41:06,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:06,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:06,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:06,896 INFO L87 Difference]: Start difference. First operand 665 states and 998 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:41:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:06,987 INFO L93 Difference]: Finished difference Result 1209 states and 1786 transitions. [2024-11-19 06:41:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:41:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 06:41:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:06,993 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 06:41:06,993 INFO L226 Difference]: Without dead ends: 1209 [2024-11-19 06:41:06,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:06,994 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 254 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:06,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 478 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-19 06:41:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1115. [2024-11-19 06:41:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1103 states have (on average 1.5176790571169538) internal successors, (1674), 1114 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:41:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1674 transitions. [2024-11-19 06:41:07,019 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1674 transitions. Word has length 22 [2024-11-19 06:41:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:07,019 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1674 transitions. [2024-11-19 06:41:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:41:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1674 transitions. [2024-11-19 06:41:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:41:07,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:07,021 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:07,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:41:07,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:07,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:07,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2024-11-19 06:41:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88212843] [2024-11-19 06:41:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:07,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:07,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:41:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:07,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:41:07,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:07,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:07,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88212843] [2024-11-19 06:41:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88212843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:07,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-19 06:41:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14011118] [2024-11-19 06:41:07,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:07,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:07,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:07,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:07,446 INFO L87 Difference]: Start difference. First operand 1115 states and 1674 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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:41:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:07,530 INFO L93 Difference]: Finished difference Result 1429 states and 2078 transitions. [2024-11-19 06:41:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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:41:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:07,536 INFO L225 Difference]: With dead ends: 1429 [2024-11-19 06:41:07,536 INFO L226 Difference]: Without dead ends: 1429 [2024-11-19 06:41:07,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:41:07,537 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:07,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 204 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-19 06:41:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1262. [2024-11-19 06:41:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1250 states have (on average 1.48) internal successors, (1850), 1261 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states 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:41:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1850 transitions. [2024-11-19 06:41:07,565 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1850 transitions. Word has length 24 [2024-11-19 06:41:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:07,565 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1850 transitions. [2024-11-19 06:41:07,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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:41:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1850 transitions. [2024-11-19 06:41:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:41:07,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:07,566 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:07,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:41:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:07,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:07,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2024-11-19 06:41:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035067674] [2024-11-19 06:41:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:07,774 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:07,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:41:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:07,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:41:07,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:07,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:07,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:07,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035067674] [2024-11-19 06:41:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035067674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:07,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-19 06:41:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694526406] [2024-11-19 06:41:07,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:07,942 INFO L87 Difference]: Start difference. First operand 1262 states and 1850 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:08,006 INFO L93 Difference]: Finished difference Result 1211 states and 1709 transitions. [2024-11-19 06:41:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:08,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:41:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:08,012 INFO L225 Difference]: With dead ends: 1211 [2024-11-19 06:41:08,012 INFO L226 Difference]: Without dead ends: 1211 [2024-11-19 06:41:08,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 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:41:08,013 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 81 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:08,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 572 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-19 06:41:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1171. [2024-11-19 06:41:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1159 states have (on average 1.450388265746333) internal successors, (1681), 1170 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states 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:41:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1681 transitions. [2024-11-19 06:41:08,035 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1681 transitions. Word has length 27 [2024-11-19 06:41:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:08,035 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1681 transitions. [2024-11-19 06:41:08,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1681 transitions. [2024-11-19 06:41:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:41:08,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:08,038 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:08,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:41:08,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:08,239 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:08,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1768537834, now seen corresponding path program 1 times [2024-11-19 06:41:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:08,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042038011] [2024-11-19 06:41:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:08,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:08,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:08,243 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:08,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:41:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:08,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:41:08,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:08,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:08,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:08,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042038011] [2024-11-19 06:41:08,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042038011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:08,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:08,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-19 06:41:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281453596] [2024-11-19 06:41:08,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:08,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:08,443 INFO L87 Difference]: Start difference. First operand 1171 states and 1681 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:41:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:08,535 INFO L93 Difference]: Finished difference Result 1126 states and 1553 transitions. [2024-11-19 06:41:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:08,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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:41:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:08,539 INFO L225 Difference]: With dead ends: 1126 [2024-11-19 06:41:08,540 INFO L226 Difference]: Without dead ends: 1126 [2024-11-19 06:41:08,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:41:08,541 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 114 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:08,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 903 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-11-19 06:41:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1093. [2024-11-19 06:41:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1081 states have (on average 1.4227567067530065) internal successors, (1538), 1092 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states 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:41:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1538 transitions. [2024-11-19 06:41:08,561 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1538 transitions. Word has length 35 [2024-11-19 06:41:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:08,561 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1538 transitions. [2024-11-19 06:41:08,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:41:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1538 transitions. [2024-11-19 06:41:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:41:08,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:08,562 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:08,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:41:08,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:08,766 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:08,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1819733348, now seen corresponding path program 1 times [2024-11-19 06:41:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:08,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003272414] [2024-11-19 06:41:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:08,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:08,771 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:08,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:41:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:08,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:41:08,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:41:08,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:41:09,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003272414] [2024-11-19 06:41:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003272414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:09,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-19 06:41:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946192895] [2024-11-19 06:41:09,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:41:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:41:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:41:09,094 INFO L87 Difference]: Start difference. First operand 1093 states and 1538 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:41:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:09,290 INFO L93 Difference]: Finished difference Result 1671 states and 2329 transitions. [2024-11-19 06:41:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:41:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-19 06:41:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:09,296 INFO L225 Difference]: With dead ends: 1671 [2024-11-19 06:41:09,296 INFO L226 Difference]: Without dead ends: 1671 [2024-11-19 06:41:09,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:41:09,298 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 440 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:09,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 940 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-11-19 06:41:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1590. [2024-11-19 06:41:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1578 states have (on average 1.4474017743979721) internal successors, (2284), 1589 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states 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:41:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2284 transitions. [2024-11-19 06:41:09,328 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2284 transitions. Word has length 40 [2024-11-19 06:41:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:09,329 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2284 transitions. [2024-11-19 06:41:09,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:41:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2284 transitions. [2024-11-19 06:41:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:41:09,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:09,331 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:09,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:41:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:09,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:09,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -414991968, now seen corresponding path program 1 times [2024-11-19 06:41:09,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:09,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820940366] [2024-11-19 06:41:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:09,536 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:09,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:41:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:09,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:41:09,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:09,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:10,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820940366] [2024-11-19 06:41:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820940366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:10,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:10,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-19 06:41:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501485158] [2024-11-19 06:41:10,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:10,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:41:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:10,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:41:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:41:10,025 INFO L87 Difference]: Start difference. First operand 1590 states and 2284 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:10,367 INFO L93 Difference]: Finished difference Result 2262 states and 3144 transitions. [2024-11-19 06:41:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:41:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-19 06:41:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:10,376 INFO L225 Difference]: With dead ends: 2262 [2024-11-19 06:41:10,376 INFO L226 Difference]: Without dead ends: 2262 [2024-11-19 06:41:10,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:41:10,377 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 851 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:10,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1525 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-11-19 06:41:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2139. [2024-11-19 06:41:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2127 states have (on average 1.4428772919605077) internal successors, (3069), 2138 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states 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:41:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3069 transitions. [2024-11-19 06:41:10,418 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 3069 transitions. Word has length 40 [2024-11-19 06:41:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 3069 transitions. [2024-11-19 06:41:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3069 transitions. [2024-11-19 06:41:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:41:10,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:10,419 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:10,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 06:41:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:10,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:10,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash 576929085, now seen corresponding path program 1 times [2024-11-19 06:41:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663691773] [2024-11-19 06:41:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:10,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:10,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:10,625 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:10,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:41:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:10,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:41:10,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:10,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:10,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663691773] [2024-11-19 06:41:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663691773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:10,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 06:41:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119008955] [2024-11-19 06:41:10,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:10,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:41:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:41:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:41:10,911 INFO L87 Difference]: Start difference. First operand 2139 states and 3069 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:41:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:11,251 INFO L93 Difference]: Finished difference Result 2674 states and 3689 transitions. [2024-11-19 06:41:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:41:11,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 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:41:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:11,262 INFO L225 Difference]: With dead ends: 2674 [2024-11-19 06:41:11,263 INFO L226 Difference]: Without dead ends: 2674 [2024-11-19 06:41:11,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:41:11,264 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1111 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:11,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1289 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-19 06:41:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2597. [2024-11-19 06:41:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2585 states have (on average 1.4205029013539652) internal successors, (3672), 2596 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states 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:41:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3672 transitions. [2024-11-19 06:41:11,313 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3672 transitions. Word has length 42 [2024-11-19 06:41:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:11,314 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 3672 transitions. [2024-11-19 06:41:11,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:41:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3672 transitions. [2024-11-19 06:41:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:41:11,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:11,315 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:11,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:11,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:11,519 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:11,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash -896397186, now seen corresponding path program 1 times [2024-11-19 06:41:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468569038] [2024-11-19 06:41:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:11,523 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:11,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 06:41:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:11,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:41:11,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:11,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:11,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468569038] [2024-11-19 06:41:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468569038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:11,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-19 06:41:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965230910] [2024-11-19 06:41:11,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:11,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:11,739 INFO L87 Difference]: Start difference. First operand 2597 states and 3672 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:41:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:11,869 INFO L93 Difference]: Finished difference Result 2584 states and 3583 transitions. [2024-11-19 06:41:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:41:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-19 06:41:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:11,879 INFO L225 Difference]: With dead ends: 2584 [2024-11-19 06:41:11,880 INFO L226 Difference]: Without dead ends: 2584 [2024-11-19 06:41:11,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:11,881 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 136 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:11,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1140 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2024-11-19 06:41:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2545. [2024-11-19 06:41:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2533 states have (on average 1.4086063955783656) internal successors, (3568), 2544 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states 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:41:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3568 transitions. [2024-11-19 06:41:11,939 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3568 transitions. Word has length 43 [2024-11-19 06:41:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3568 transitions. [2024-11-19 06:41:11,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:41:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3568 transitions. [2024-11-19 06:41:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:41:11,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:11,941 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:11,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:12,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:12,142 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:12,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1836881493, now seen corresponding path program 1 times [2024-11-19 06:41:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040474984] [2024-11-19 06:41:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:12,147 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:12,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 06:41:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:12,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:41:12,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:12,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:12,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040474984] [2024-11-19 06:41:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040474984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:12,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:12,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-19 06:41:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630230037] [2024-11-19 06:41:12,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:41:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:41:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:41:12,411 INFO L87 Difference]: Start difference. First operand 2545 states and 3568 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:41:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:12,547 INFO L93 Difference]: Finished difference Result 2577 states and 3544 transitions. [2024-11-19 06:41:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:41:12,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-19 06:41:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:12,555 INFO L225 Difference]: With dead ends: 2577 [2024-11-19 06:41:12,556 INFO L226 Difference]: Without dead ends: 2577 [2024-11-19 06:41:12,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:41:12,556 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 168 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:12,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1571 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2024-11-19 06:41:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2519. [2024-11-19 06:41:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2507 states have (on average 1.402473075388911) internal successors, (3516), 2518 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states 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:41:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3516 transitions. [2024-11-19 06:41:12,594 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3516 transitions. Word has length 53 [2024-11-19 06:41:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:12,594 INFO L471 AbstractCegarLoop]: Abstraction has 2519 states and 3516 transitions. [2024-11-19 06:41:12,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:41:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3516 transitions. [2024-11-19 06:41:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 06:41:12,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:12,596 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:12,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-19 06:41:12,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:12,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 2 times [2024-11-19 06:41:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464338591] [2024-11-19 06:41:12,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:41:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:12,803 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:12,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 06:41:12,918 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:41:12,919 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:41:12,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:41:12,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 58 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:41:13,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 58 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:41:13,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464338591] [2024-11-19 06:41:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464338591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:13,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2024-11-19 06:41:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969625882] [2024-11-19 06:41:13,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:13,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:41:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:41:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:41:13,533 INFO L87 Difference]: Start difference. First operand 2519 states and 3516 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 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:41:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:14,007 INFO L93 Difference]: Finished difference Result 2330 states and 3103 transitions. [2024-11-19 06:41:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:41:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 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) Word has length 63 [2024-11-19 06:41:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:14,014 INFO L225 Difference]: With dead ends: 2330 [2024-11-19 06:41:14,015 INFO L226 Difference]: Without dead ends: 2330 [2024-11-19 06:41:14,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:41:14,016 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 775 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:14,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1617 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2024-11-19 06:41:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2255. [2024-11-19 06:41:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2243 states have (on average 1.376727596968346) internal successors, (3088), 2254 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states 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:41:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3088 transitions. [2024-11-19 06:41:14,071 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3088 transitions. Word has length 63 [2024-11-19 06:41:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:14,071 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 3088 transitions. [2024-11-19 06:41:14,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 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:41:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3088 transitions. [2024-11-19 06:41:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 06:41:14,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:14,072 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:14,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-19 06:41:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,273 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:41:14,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2024-11-19 06:41:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:14,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964125019] [2024-11-19 06:41:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:14,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:14,276 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:14,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 06:41:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:41:14,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:41:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:41:14,548 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 06:41:14,548 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:41:14,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-19 06:41:14,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-19 06:41:14,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-19 06:41:14,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-19 06:41:14,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-19 06:41:14,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-19 06:41:14,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-19 06:41:14,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-19 06:41:14,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-19 06:41:14,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-19 06:41:14,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-19 06:41:14,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-19 06:41:14,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-19 06:41:14,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-19 06:41:14,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-19 06:41:14,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-19 06:41:14,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-19 06:41:14,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-19 06:41:14,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-19 06:41:14,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-19 06:41:14,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:14,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,759 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:14,837 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:41:14,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:41:14 BoogieIcfgContainer [2024-11-19 06:41:14,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:41:14,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:41:14,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:41:14,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:41:14,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:02" (3/4) ... [2024-11-19 06:41:14,845 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 06:41:14,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:41:14,847 INFO L158 Benchmark]: Toolchain (without parser) took 13925.96ms. Allocated memory was 71.3MB in the beginning and 176.2MB in the end (delta: 104.9MB). Free memory was 32.4MB in the beginning and 110.3MB in the end (delta: -77.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-19 06:41:14,847 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:41:14,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.13ms. Allocated memory is still 71.3MB. Free memory was 32.2MB in the beginning and 32.6MB in the end (delta: -367.3kB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-19 06:41:14,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.63ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 30.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:41:14,848 INFO L158 Benchmark]: Boogie Preprocessor took 87.67ms. Allocated memory was 71.3MB in the beginning and 121.6MB in the end (delta: 50.3MB). Free memory was 30.4MB in the beginning and 99.4MB in the end (delta: -68.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:41:14,849 INFO L158 Benchmark]: RCFGBuilder took 641.20ms. Allocated memory is still 121.6MB. Free memory was 99.4MB in the beginning and 76.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:41:14,849 INFO L158 Benchmark]: TraceAbstraction took 12567.09ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 76.3MB in the beginning and 110.3MB in the end (delta: -34.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-19 06:41:14,849 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 176.2MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:41:14,850 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.13ms. Allocated memory is still 71.3MB. Free memory was 32.2MB in the beginning and 32.6MB in the end (delta: -367.3kB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.63ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 30.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.67ms. Allocated memory was 71.3MB in the beginning and 121.6MB in the end (delta: 50.3MB). Free memory was 30.4MB in the beginning and 99.4MB in the end (delta: -68.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 641.20ms. Allocated memory is still 121.6MB. Free memory was 99.4MB in the beginning and 76.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12567.09ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 76.3MB in the beginning and 110.3MB in the end (delta: -34.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 176.2MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L545] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L552] S = x1 VAL [S={6:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={6:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L536] case 1: [L541] case 2: VAL [S={6:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L541] case 2: [L544] case 3: [L547] case 4: VAL [S={6:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={6:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4742 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4742 mSDsluCounter, 12396 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9813 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1293 IncrementalHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 2583 mSDtfsCounter, 1293 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 935 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2597occurred in iteration=17, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 1028 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 872 ConstructedInterpolants, 0 QuantifiedInterpolants, 3484 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1829 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 386/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 06:41:14,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample