./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_2.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 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:38:05,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:38:05,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:38:05,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:38:05,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:38:05,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:38:05,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:38:05,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:38:05,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:38:05,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:38:05,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:38:05,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:38:05,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:38:05,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:38:05,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:38:05,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:38:05,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:38:05,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:38:05,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:38:05,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:38:05,299 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:38:05,299 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:38:05,299 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:38:05,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:38:05,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:38:05,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:38:05,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:38:05,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:38:05,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:38:05,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:38:05,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:38:05,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:38:05,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:38:05,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:38:05,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:38:05,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:38:05,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:38:05,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:38:05,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:38:05,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:38:05,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:38:05,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:38:05,305 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 -> 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb [2024-11-22 18:38:05,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:38:05,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:38:05,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:38:05,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:38:05,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:38:05,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_2.i [2024-11-22 18:38:06,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:38:07,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:38:07,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i [2024-11-22 18:38:07,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e01aedc/bf39fa3a69954e599533264b52b87790/FLAG5519cc640 [2024-11-22 18:38:07,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e01aedc/bf39fa3a69954e599533264b52b87790 [2024-11-22 18:38:07,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:38:07,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:38:07,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:38:07,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:38:07,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:38:07,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221e0b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07, skipping insertion in model container [2024-11-22 18:38:07,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:38:07,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:38:07,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:38:07,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:38:07,832 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:38:07,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07 WrapperNode [2024-11-22 18:38:07,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:38:07,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:38:07,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:38:07,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:38:07,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,868 INFO L138 Inliner]: procedures = 125, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2024-11-22 18:38:07,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:38:07,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:38:07,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:38:07,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:38:07,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,892 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-22 18:38:07,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:38:07,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:38:07,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:38:07,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:38:07,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (1/1) ... [2024-11-22 18:38:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:38:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:38:08,008 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-22 18:38:08,012 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-22 18:38:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-22 18:38:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-22 18:38:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:38:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:38:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:38:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:38:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:38:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:38:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:38:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:38:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:38:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:38:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:38:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:38:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:38:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:38:08,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:38:08,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:38:08,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:38:08,190 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-22 18:38:08,420 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-22 18:38:08,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:38:08,434 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:38:08,435 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 18:38:08,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:38:08 BoogieIcfgContainer [2024-11-22 18:38:08,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:38:08,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:38:08,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:38:08,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:38:08,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:38:07" (1/3) ... [2024-11-22 18:38:08,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77231341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:38:08, skipping insertion in model container [2024-11-22 18:38:08,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:07" (2/3) ... [2024-11-22 18:38:08,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77231341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:38:08, skipping insertion in model container [2024-11-22 18:38:08,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:38:08" (3/3) ... [2024-11-22 18:38:08,444 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_2.i [2024-11-22 18:38:08,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:38:08,458 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-11-22 18:38:08,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:38:08,509 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;@5f95562d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:38:08,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-22 18:38:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 55 states have (on average 2.0) internal successors, (110), 95 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:38:08,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:08,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:08,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2024-11-22 18:38:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257534559] [2024-11-22 18:38:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:08,662 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-22 18:38:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257534559] [2024-11-22 18:38:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257534559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:38:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989815459] [2024-11-22 18:38:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:08,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:38:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:08,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:38:08,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:38:08,691 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 2.0) internal successors, (110), 95 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) 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-22 18:38:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:08,704 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-22 18:38:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:38:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) 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-22 18:38:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:08,711 INFO L225 Difference]: With dead ends: 96 [2024-11-22 18:38:08,712 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 18:38:08,713 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-22 18:38:08,715 INFO L432 NwaCegarLoop]: 105 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, 105 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-22 18:38:08,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:38:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 18:38:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-22 18:38:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 88 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-22 18:38:08,741 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 7 [2024-11-22 18:38:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:08,741 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-22 18:38:08,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) 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-22 18:38:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-22 18:38:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:38:08,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:08,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:38:08,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2024-11-22 18:38:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73507487] [2024-11-22 18:38:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73507487] [2024-11-22 18:38:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73507487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:38:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405472189] [2024-11-22 18:38:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:38:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:38:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:38:08,836 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:08,955 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2024-11-22 18:38:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:38:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:08,956 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:38:08,956 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:38:08,957 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-22 18:38:08,957 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 111 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:08,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 59 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:38:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 18:38:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2024-11-22 18:38:08,963 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 8 [2024-11-22 18:38:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:08,964 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2024-11-22 18:38:08,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2024-11-22 18:38:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:38:08,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:08,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:08,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:38:08,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2024-11-22 18:38:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:08,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105083319] [2024-11-22 18:38:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:09,059 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-22 18:38:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105083319] [2024-11-22 18:38:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105083319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:09,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:09,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:38:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89269579] [2024-11-22 18:38:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:09,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:38:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:09,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:38:09,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:38:09,062 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:09,192 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2024-11-22 18:38:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:38:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:09,193 INFO L225 Difference]: With dead ends: 111 [2024-11-22 18:38:09,193 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 18:38:09,194 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-22 18:38:09,194 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 115 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:09,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 87 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 18:38:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-22 18:38:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2024-11-22 18:38:09,201 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 8 [2024-11-22 18:38:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2024-11-22 18:38:09,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2024-11-22 18:38:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:38:09,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:09,202 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:09,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:38:09,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:09,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2024-11-22 18:38:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72004728] [2024-11-22 18:38:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:09,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72004728] [2024-11-22 18:38:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72004728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:09,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:09,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230728876] [2024-11-22 18:38:09,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:09,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:09,382 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:09,530 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2024-11-22 18:38:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:38:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 18:38:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:09,531 INFO L225 Difference]: With dead ends: 115 [2024-11-22 18:38:09,531 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 18:38:09,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:09,532 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:09,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 208 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 18:38:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-22 18:38:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 114 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2024-11-22 18:38:09,537 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 17 [2024-11-22 18:38:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:09,537 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2024-11-22 18:38:09,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2024-11-22 18:38:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:38:09,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:09,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:09,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:38:09,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:09,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2024-11-22 18:38:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292724633] [2024-11-22 18:38:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292724633] [2024-11-22 18:38:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292724633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537670042] [2024-11-22 18:38:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:09,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:09,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:09,691 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:09,868 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2024-11-22 18:38:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:38:09,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 18:38:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:09,870 INFO L225 Difference]: With dead ends: 118 [2024-11-22 18:38:09,870 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 18:38:09,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:09,871 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:09,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 254 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:38:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 18:38:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-11-22 18:38:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-11-22 18:38:09,875 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2024-11-22 18:38:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:09,875 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-11-22 18:38:09,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-11-22 18:38:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:38:09,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:09,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:09,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:38:09,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:09,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1188236787, now seen corresponding path program 1 times [2024-11-22 18:38:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:09,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205905518] [2024-11-22 18:38:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205905518] [2024-11-22 18:38:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205905518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:38:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971225295] [2024-11-22 18:38:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:10,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:38:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:38:10,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:38:10,011 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:10,140 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2024-11-22 18:38:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:38:10,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:38:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:10,141 INFO L225 Difference]: With dead ends: 163 [2024-11-22 18:38:10,141 INFO L226 Difference]: Without dead ends: 163 [2024-11-22 18:38:10,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:38:10,142 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 72 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:10,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 246 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-22 18:38:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 111. [2024-11-22 18:38:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 110 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2024-11-22 18:38:10,147 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 19 [2024-11-22 18:38:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2024-11-22 18:38:10,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2024-11-22 18:38:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:38:10,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:10,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:38:10,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403471, now seen corresponding path program 1 times [2024-11-22 18:38:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333484476] [2024-11-22 18:38:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:10,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333484476] [2024-11-22 18:38:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333484476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:10,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:10,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958522667] [2024-11-22 18:38:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:10,219 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:10,333 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2024-11-22 18:38:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:38:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-22 18:38:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:10,335 INFO L225 Difference]: With dead ends: 109 [2024-11-22 18:38:10,335 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 18:38:10,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:10,335 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 24 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:10,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 180 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 18:38:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-22 18:38:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 108 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-22 18:38:10,340 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 20 [2024-11-22 18:38:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:10,340 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-22 18:38:10,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-22 18:38:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:38:10,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:10,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:38:10,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:10,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403472, now seen corresponding path program 1 times [2024-11-22 18:38:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562591695] [2024-11-22 18:38:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562591695] [2024-11-22 18:38:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562591695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774375134] [2024-11-22 18:38:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:10,589 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:10,751 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-22 18:38:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:38:10,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-22 18:38:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:10,752 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:38:10,753 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:38:10,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:10,754 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:10,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:38:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2024-11-22 18:38:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-22 18:38:10,757 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2024-11-22 18:38:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:10,758 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-22 18:38:10,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-22 18:38:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:38:10,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:10,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:38:10,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash 518170586, now seen corresponding path program 1 times [2024-11-22 18:38:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:10,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856160192] [2024-11-22 18:38:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:38:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856160192] [2024-11-22 18:38:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856160192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:10,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:10,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:38:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139079122] [2024-11-22 18:38:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:10,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:38:10,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:38:10,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:38:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:38:10,865 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:11,002 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2024-11-22 18:38:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:38:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 18:38:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:11,003 INFO L225 Difference]: With dead ends: 133 [2024-11-22 18:38:11,003 INFO L226 Difference]: Without dead ends: 133 [2024-11-22 18:38:11,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:38:11,005 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 51 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:11,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 287 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:38:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-22 18:38:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2024-11-22 18:38:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-22 18:38:11,012 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 21 [2024-11-22 18:38:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:11,012 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-22 18:38:11,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-22 18:38:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:38:11,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:11,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:11,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:38:11,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -304773872, now seen corresponding path program 1 times [2024-11-22 18:38:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:38:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872314105] [2024-11-22 18:38:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:38:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:38:11,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:38:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:38:11,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:38:11,068 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:38:11,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2024-11-22 18:38:11,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2024-11-22 18:38:11,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2024-11-22 18:38:11,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2024-11-22 18:38:11,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2024-11-22 18:38:11,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2024-11-22 18:38:11,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2024-11-22 18:38:11,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2024-11-22 18:38:11,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2024-11-22 18:38:11,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2024-11-22 18:38:11,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2024-11-22 18:38:11,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2024-11-22 18:38:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2024-11-22 18:38:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:38:11,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:11,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:38:11,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:38:11 BoogieIcfgContainer [2024-11-22 18:38:11,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:38:11,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:38:11,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:38:11,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:38:11,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:38:08" (3/4) ... [2024-11-22 18:38:11,111 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 18:38:11,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:38:11,113 INFO L158 Benchmark]: Toolchain (without parser) took 3584.78ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 124.5MB in the beginning and 115.0MB in the end (delta: 9.5MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-11-22 18:38:11,113 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:38:11,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.81ms. Allocated memory is still 192.9MB. Free memory was 124.3MB in the beginning and 104.6MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:38:11,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.41ms. Allocated memory is still 192.9MB. Free memory was 104.6MB in the beginning and 102.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:38:11,114 INFO L158 Benchmark]: Boogie Preprocessor took 42.41ms. Allocated memory is still 192.9MB. Free memory was 102.5MB in the beginning and 99.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:38:11,114 INFO L158 Benchmark]: RCFGBuilder took 523.63ms. Allocated memory is still 192.9MB. Free memory was 99.6MB in the beginning and 141.7MB in the end (delta: -42.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-22 18:38:11,114 INFO L158 Benchmark]: TraceAbstraction took 2670.84ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 140.8MB in the beginning and 115.0MB in the end (delta: 25.8MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-22 18:38:11,115 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 260.0MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:38:11,116 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 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.81ms. Allocated memory is still 192.9MB. Free memory was 124.3MB in the beginning and 104.6MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.41ms. Allocated memory is still 192.9MB. Free memory was 104.6MB in the beginning and 102.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.41ms. Allocated memory is still 192.9MB. Free memory was 102.5MB in the beginning and 99.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.63ms. Allocated memory is still 192.9MB. Free memory was 99.6MB in the beginning and 141.7MB in the end (delta: -42.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2670.84ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 140.8MB in the beginning and 115.0MB in the end (delta: 25.8MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 260.0MB. Free memory is still 115.0MB. 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: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L533] int i = 0; [L534] int y = 0; [L535] List a = (List) malloc(sizeof(struct node)); [L536] COND FALSE !(a == 0) VAL [a={-2:0}, i=0, y=0] [L537] List t; [L538] List p = a; VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L539] i < 10 && __VERIFIER_nondet_int() [L539] i < 10 && __VERIFIER_nondet_int() VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L539] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L547] y < 10 && __VERIFIER_nondet_int() [L547] y < 10 && __VERIFIER_nondet_int() VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L547] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L555] p->h = 3 [L556] p->n = (void*)__VERIFIER_nondet_ulong() [L557] i = 0 [L558] y = 0 [L559] p = a VAL [a={-2:0}, i=0, p={-2:0}, y=0] [L560] EXPR p->h [L560] COND FALSE !(p->h == 1) [L564] EXPR p->h [L564] COND FALSE !(p->h == 2) [L568] EXPR p->h [L568] COND TRUE p->h != 3 || (i + y) < 20 [L569] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext_2.c", 3, __extension__ __PRETTY_FUNCTION__) - 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: -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: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 1651 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1067 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1433 IncrementalHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 584 mSDtfsCounter, 1433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 120 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 16/16 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-22 18:38:11,139 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_2.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 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:38:13,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:38:13,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 18:38:13,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:38:13,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:38:13,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:38:13,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:38:13,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:38:13,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:38:13,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:38:13,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:38:13,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:38:13,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:38:13,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:38:13,666 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:38:13,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:38:13,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:38:13,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:38:13,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:38:13,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:38:13,667 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:38:13,668 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:38:13,668 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:38:13,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:38:13,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:38:13,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:38:13,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:38:13,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:38:13,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:38:13,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:38:13,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:38:13,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:38:13,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:38:13,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:38:13,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:38:13,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:38:13,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:38:13,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:38:13,676 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:38:13,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:38:13,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:38:13,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:38:13,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:38:13,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:38:13,680 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 -> 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb [2024-11-22 18:38:13,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:38:13,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:38:13,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:38:13,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:38:13,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:38:13,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_2.i [2024-11-22 18:38:15,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:38:15,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:38:15,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i [2024-11-22 18:38:15,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b55b6bd0/48c0af14abdf4a0c9a7aa790f21a88eb/FLAG6400e465a [2024-11-22 18:38:15,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b55b6bd0/48c0af14abdf4a0c9a7aa790f21a88eb [2024-11-22 18:38:15,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:38:15,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:38:15,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:38:15,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:38:15,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:38:15,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:38:15" (1/1) ... [2024-11-22 18:38:15,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22468bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:15, skipping insertion in model container [2024-11-22 18:38:15,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:38:15" (1/1) ... [2024-11-22 18:38:15,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:38:15,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:38:15,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:38:16,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:38:16,067 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:38:16,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16 WrapperNode [2024-11-22 18:38:16,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:38:16,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:38:16,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:38:16,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:38:16,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,106 INFO L138 Inliner]: procedures = 128, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2024-11-22 18:38:16,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:38:16,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:38:16,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:38:16,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:38:16,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,129 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-22 18:38:16,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:38:16,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:38:16,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:38:16,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:38:16,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (1/1) ... [2024-11-22 18:38:16,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:38:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:38:16,171 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-22 18:38:16,173 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-22 18:38:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-22 18:38:16,216 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-22 18:38:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:38:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:38:16,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 18:38:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 18:38:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 18:38:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:38:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:38:16,335 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:38:16,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:38:16,359 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-22 18:38:16,718 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-22 18:38:16,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:38:16,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:38:16,732 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 18:38:16,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:38:16 BoogieIcfgContainer [2024-11-22 18:38:16,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:38:16,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:38:16,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:38:16,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:38:16,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:38:15" (1/3) ... [2024-11-22 18:38:16,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c7fd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:38:16, skipping insertion in model container [2024-11-22 18:38:16,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:38:16" (2/3) ... [2024-11-22 18:38:16,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c7fd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:38:16, skipping insertion in model container [2024-11-22 18:38:16,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:38:16" (3/3) ... [2024-11-22 18:38:16,740 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_2.i [2024-11-22 18:38:16,754 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:38:16,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-11-22 18:38:16,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:38:16,803 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;@7c717109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:38:16,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-22 18:38:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 55 states have (on average 2.0) internal successors, (110), 95 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:38:16,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:16,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:16,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2024-11-22 18:38:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647725725] [2024-11-22 18:38:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:16,833 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-22 18:38:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:16,835 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-22 18:38:16,841 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-22 18:38:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:16,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 18:38:16,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:16,924 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-22 18:38:16,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:16,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:16,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647725725] [2024-11-22 18:38:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647725725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:16,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:38:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383816053] [2024-11-22 18:38:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:38:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:38:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:38:16,984 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 2.0) internal successors, (110), 95 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) 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-22 18:38:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:17,010 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-22 18:38:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:38:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) 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-22 18:38:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:17,016 INFO L225 Difference]: With dead ends: 96 [2024-11-22 18:38:17,016 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 18:38:17,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-22 18:38:17,020 INFO L432 NwaCegarLoop]: 105 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, 105 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-22 18:38:17,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:38:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 18:38:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-22 18:38:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 88 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-22 18:38:17,054 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 7 [2024-11-22 18:38:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:17,055 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-22 18:38:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) 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-22 18:38:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-22 18:38:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:38:17,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:17,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:17,060 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 (2)] Ended with exit code 0 [2024-11-22 18:38:17,257 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-22 18:38:17,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2024-11-22 18:38:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008624971] [2024-11-22 18:38:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:17,260 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-22 18:38:17,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:17,263 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-22 18:38:17,264 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-22 18:38:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:17,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:38:17,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:17,350 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-22 18:38:17,388 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-22 18:38:17,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:17,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008624971] [2024-11-22 18:38:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008624971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:17,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:38:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528120023] [2024-11-22 18:38:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:38:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:38:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:38:17,395 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:17,802 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2024-11-22 18:38:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:38:17,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:17,804 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:38:17,804 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:38:17,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-22 18:38:17,805 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 111 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:17,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 59 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:38:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:38:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 18:38:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2024-11-22 18:38:17,818 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 8 [2024-11-22 18:38:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:17,818 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2024-11-22 18:38:17,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2024-11-22 18:38:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:38:17,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:17,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:17,830 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 (3)] Forceful destruction successful, exit code 0 [2024-11-22 18:38:18,026 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-22 18:38:18,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2024-11-22 18:38:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793908091] [2024-11-22 18:38:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:18,029 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-22 18:38:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:18,035 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-22 18:38:18,036 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-22 18:38:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:18,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:38:18,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:18,082 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-22 18:38:18,162 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-22 18:38:18,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:18,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:18,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793908091] [2024-11-22 18:38:18,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793908091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:18,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:38:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800467972] [2024-11-22 18:38:18,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:18,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:38:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:18,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:38:18,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:38:18,164 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:18,370 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2024-11-22 18:38:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:38:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:18,372 INFO L225 Difference]: With dead ends: 111 [2024-11-22 18:38:18,373 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 18:38:18,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-22 18:38:18,374 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 115 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:18,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 87 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:38:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 18:38:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-22 18:38:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2024-11-22 18:38:18,379 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 8 [2024-11-22 18:38:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:18,379 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2024-11-22 18:38:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 18:38:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2024-11-22 18:38:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:38:18,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:18,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:18,385 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 (4)] Ended with exit code 0 [2024-11-22 18:38:18,584 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-22 18:38:18,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:18,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2024-11-22 18:38:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087248447] [2024-11-22 18:38:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:18,586 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-22 18:38:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:18,589 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-22 18:38:18,590 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-22 18:38:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:18,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:38:18,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:18,646 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-22 18:38:18,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:38:18,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:38:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:18,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:18,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087248447] [2024-11-22 18:38:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087248447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:18,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:18,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135307850] [2024-11-22 18:38:18,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:18,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:18,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:18,710 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:18,996 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2024-11-22 18:38:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:38:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 18:38:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:18,997 INFO L225 Difference]: With dead ends: 115 [2024-11-22 18:38:18,997 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 18:38:18,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-22 18:38:18,998 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:18,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 208 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:38:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 18:38:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-22 18:38:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 114 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2024-11-22 18:38:19,003 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 17 [2024-11-22 18:38:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:19,003 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2024-11-22 18:38:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2024-11-22 18:38:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:38:19,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:19,004 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:19,009 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-22 18:38:19,204 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-22 18:38:19,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:19,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2024-11-22 18:38:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048678990] [2024-11-22 18:38:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:19,206 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-22 18:38:19,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:19,207 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-22 18:38:19,208 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-22 18:38:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:19,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:38:19,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:19,286 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-22 18:38:19,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:38:19,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:38:19,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-22 18:38:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:19,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:19,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048678990] [2024-11-22 18:38:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048678990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723694525] [2024-11-22 18:38:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:19,414 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:19,733 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2024-11-22 18:38:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:38:19,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 18:38:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:19,735 INFO L225 Difference]: With dead ends: 118 [2024-11-22 18:38:19,735 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 18:38:19,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:19,735 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:19,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 254 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:38:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 18:38:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-11-22 18:38:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-11-22 18:38:19,740 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2024-11-22 18:38:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:19,740 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-11-22 18:38:19,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-11-22 18:38:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:38:19,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:19,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:19,751 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-22 18:38:19,943 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-22 18:38:19,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1188236787, now seen corresponding path program 1 times [2024-11-22 18:38:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524977347] [2024-11-22 18:38:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:19,948 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-22 18:38:19,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:19,954 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-22 18:38:19,955 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-22 18:38:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:20,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:38:20,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:20,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:38:20,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:38:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:20,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:20,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524977347] [2024-11-22 18:38:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524977347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:20,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:38:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786264549] [2024-11-22 18:38:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:20,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:38:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:38:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:38:20,123 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:20,399 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2024-11-22 18:38:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:38:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:38:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:20,400 INFO L225 Difference]: With dead ends: 146 [2024-11-22 18:38:20,400 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 18:38:20,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:20,401 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:20,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 240 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:38:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 18:38:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2024-11-22 18:38:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 110 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2024-11-22 18:38:20,407 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 19 [2024-11-22 18:38:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:20,408 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2024-11-22 18:38:20,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2024-11-22 18:38:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:38:20,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:20,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:20,417 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-22 18:38:20,611 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-22 18:38:20,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:20,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403471, now seen corresponding path program 1 times [2024-11-22 18:38:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516888558] [2024-11-22 18:38:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:20,613 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-22 18:38:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:20,615 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-22 18:38:20,616 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-22 18:38:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:20,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:38:20,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:20,708 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-22 18:38:20,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:38:20,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:38:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:20,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:20,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516888558] [2024-11-22 18:38:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516888558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101834398] [2024-11-22 18:38:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:20,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:20,761 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:20,989 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2024-11-22 18:38:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:38:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-22 18:38:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:20,990 INFO L225 Difference]: With dead ends: 109 [2024-11-22 18:38:20,990 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 18:38:20,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-22 18:38:20,991 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 24 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:20,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 180 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:38:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 18:38:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-22 18:38:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 108 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-22 18:38:20,995 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 20 [2024-11-22 18:38:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-22 18:38:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-22 18:38:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:38:20,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:20,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:21,001 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-22 18:38:21,199 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-22 18:38:21,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403472, now seen corresponding path program 1 times [2024-11-22 18:38:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155580819] [2024-11-22 18:38:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:21,203 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-22 18:38:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:21,205 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-22 18:38:21,208 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-22 18:38:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:21,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:38:21,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:21,336 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-22 18:38:21,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:38:21,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:38:21,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-22 18:38:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:21,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:21,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155580819] [2024-11-22 18:38:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155580819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:38:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868927974] [2024-11-22 18:38:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:38:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:38:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:38:21,523 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:21,800 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-22 18:38:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:38:21,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-22 18:38:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:21,801 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:38:21,801 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:38:21,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:21,802 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:21,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:38:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:38:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2024-11-22 18:38:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-22 18:38:21,808 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2024-11-22 18:38:21,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:21,808 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-22 18:38:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-22 18:38:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:38:21,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:21,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:21,817 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-22 18:38:22,009 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-22 18:38:22,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:22,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash 518170586, now seen corresponding path program 1 times [2024-11-22 18:38:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197431482] [2024-11-22 18:38:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:22,010 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-22 18:38:22,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:22,011 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-22 18:38:22,013 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-22 18:38:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:38:22,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:38:22,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:38:22,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:38:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:38:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:38:22,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:38:22,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:38:22,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197431482] [2024-11-22 18:38:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197431482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:38:22,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:38:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:38:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915061490] [2024-11-22 18:38:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:38:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:38:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:38:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:38:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:38:22,192 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:38:22,432 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2024-11-22 18:38:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:38:22,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 18:38:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:38:22,433 INFO L225 Difference]: With dead ends: 118 [2024-11-22 18:38:22,433 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 18:38:22,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:38:22,434 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:38:22,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 231 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:38:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 18:38:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2024-11-22 18:38:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-22 18:38:22,438 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 21 [2024-11-22 18:38:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:38:22,439 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-22 18:38:22,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:38:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-22 18:38:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:38:22,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:38:22,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:22,444 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 (10)] Ended with exit code 0 [2024-11-22 18:38:22,643 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-22 18:38:22,643 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2024-11-22 18:38:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:38:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash -304773872, now seen corresponding path program 1 times [2024-11-22 18:38:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:38:22,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848527127] [2024-11-22 18:38:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:38:22,647 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-22 18:38:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:38:22,648 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-22 18:38:22,653 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-22 18:38:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:38:22,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:38:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:38:22,752 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 18:38:22,753 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:38:22,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2024-11-22 18:38:22,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2024-11-22 18:38:22,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2024-11-22 18:38:22,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2024-11-22 18:38:22,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2024-11-22 18:38:22,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2024-11-22 18:38:22,766 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-22 18:38:22,959 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-22 18:38:22,962 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:38:22,978 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:38:22,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:38:22 BoogieIcfgContainer [2024-11-22 18:38:22,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:38:22,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:38:22,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:38:22,980 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:38:22,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:38:16" (3/4) ... [2024-11-22 18:38:22,982 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 18:38:22,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:38:22,984 INFO L158 Benchmark]: Toolchain (without parser) took 7306.69ms. Allocated memory was 65.0MB in the beginning and 125.8MB in the end (delta: 60.8MB). Free memory was 39.5MB in the beginning and 80.4MB in the end (delta: -40.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-22 18:38:22,984 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:38:22,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.05ms. Allocated memory is still 65.0MB. Free memory was 39.4MB in the beginning and 34.5MB in the end (delta: 4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 18:38:22,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.85ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 32.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:38:22,984 INFO L158 Benchmark]: Boogie Preprocessor took 37.40ms. Allocated memory is still 65.0MB. Free memory was 32.3MB in the beginning and 29.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 18:38:22,984 INFO L158 Benchmark]: RCFGBuilder took 588.26ms. Allocated memory is still 65.0MB. Free memory was 29.2MB in the beginning and 39.5MB in the end (delta: -10.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-22 18:38:22,984 INFO L158 Benchmark]: TraceAbstraction took 6245.76ms. Allocated memory was 65.0MB in the beginning and 125.8MB in the end (delta: 60.8MB). Free memory was 38.8MB in the beginning and 80.4MB in the end (delta: -41.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-22 18:38:22,985 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 125.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:38:22,985 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.95ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.05ms. Allocated memory is still 65.0MB. Free memory was 39.4MB in the beginning and 34.5MB in the end (delta: 4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.85ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 32.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.40ms. Allocated memory is still 65.0MB. Free memory was 32.3MB in the beginning and 29.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 588.26ms. Allocated memory is still 65.0MB. Free memory was 29.2MB in the beginning and 39.5MB in the end (delta: -10.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6245.76ms. Allocated memory was 65.0MB in the beginning and 125.8MB in the end (delta: 60.8MB). Free memory was 38.8MB in the beginning and 80.4MB in the end (delta: -41.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 125.8MB. Free memory is still 80.4MB. 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: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L533] int i = 0; [L534] int y = 0; [L535] List a = (List) malloc(sizeof(struct node)); [L536] COND FALSE !(a == 0) VAL [a={6:0}, i=0, y=0] [L537] List t; [L538] List p = a; VAL [a={6:0}, i=0, p={6:0}, y=0] [L539] i < 10 && __VERIFIER_nondet_int() [L539] i < 10 && __VERIFIER_nondet_int() VAL [a={6:0}, i=0, p={6:0}, y=0] [L539] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L547] y < 10 && __VERIFIER_nondet_int() [L547] y < 10 && __VERIFIER_nondet_int() VAL [a={6:0}, i=0, p={6:0}, y=0] [L547] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L555] p->h = 3 [L556] p->n = (void*)__VERIFIER_nondet_ulong() [L557] i = 0 [L558] y = 0 [L559] p = a VAL [a={6:0}, i=0, p={6:0}, y=0] [L560] EXPR p->h [L560] COND FALSE !(p->h == 1) [L564] EXPR p->h [L564] COND FALSE !(p->h == 2) [L568] EXPR p->h [L568] COND TRUE p->h != 3 || (i + y) < 20 [L569] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext_2.c", 3, __extension__ __PRETTY_FUNCTION__) - 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: -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: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 1589 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1018 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 571 mSDtfsCounter, 1381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 648 SizeOfPredicates, 19 NumberOfNonLiveVariables, 578 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 16/16 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-22 18:38:23,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample