./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:56:20,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:56:20,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:56:20,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:56:20,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:56:20,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:56:20,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:56:20,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:56:20,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:56:20,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:56:20,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:56:20,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:56:20,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:56:20,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:56:20,850 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:56:20,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:56:20,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:56:20,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:56:20,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:56:20,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:56:20,852 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:56:20,853 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:56:20,853 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:56:20,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:56:20,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:56:20,854 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:56:20,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:56:20,855 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:56:20,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:56:20,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:56:20,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:56:20,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:56:20,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:56:20,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:20,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:56:20,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:56:20,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:56:20,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:56:20,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:56:20,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:56:20,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:56:20,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:56:20,861 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-clean/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-clean/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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2024-10-11 17:56:21,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:56:21,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:56:21,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:56:21,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:56:21,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:56:21,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-10-11 17:56:22,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:56:22,801 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:56:22,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-10-11 17:56:22,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1e1e005fe/5bec7e1bfd33406885e578118df1372e/FLAG7d9c7db26 [2024-10-11 17:56:22,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1e1e005fe/5bec7e1bfd33406885e578118df1372e [2024-10-11 17:56:22,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:56:22,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:56:22,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:56:22,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:56:22,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:56:22,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:22" (1/1) ... [2024-10-11 17:56:22,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f5b7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:22, skipping insertion in model container [2024-10-11 17:56:22,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:22" (1/1) ... [2024-10-11 17:56:22,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:56:23,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:56:23,238 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:56:23,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:56:23,335 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:56:23,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23 WrapperNode [2024-10-11 17:56:23,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:56:23,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:56:23,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:56:23,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:56:23,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,395 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2024-10-11 17:56:23,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:56:23,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:56:23,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:56:23,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:56:23,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,433 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-11 17:56:23,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:56:23,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:56:23,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:56:23,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:56:23,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (1/1) ... [2024-10-11 17:56:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:56:23,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:56:23,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:56:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:56:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:56:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:56:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:56:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:56:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:56:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:56:23,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:56:23,677 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:56:23,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:56:23,940 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 17:56:23,940 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:56:23,979 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:56:23,979 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:56:23,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:23 BoogieIcfgContainer [2024-10-11 17:56:23,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:56:23,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:56:23,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:56:23,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:56:23,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:56:22" (1/3) ... [2024-10-11 17:56:23,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8e1a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:23, skipping insertion in model container [2024-10-11 17:56:23,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:23" (2/3) ... [2024-10-11 17:56:23,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8e1a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:23, skipping insertion in model container [2024-10-11 17:56:23,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:23" (3/3) ... [2024-10-11 17:56:23,990 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2024-10-11 17:56:24,007 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:56:24,007 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 17:56:24,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:56:24,059 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;@1aef2c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:56:24,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:56:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 2.142857142857143) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:56:24,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:24,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:56:24,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:24,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash 5969409, now seen corresponding path program 1 times [2024-10-11 17:56:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114343099] [2024-10-11 17:56:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:24,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114343099] [2024-10-11 17:56:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114343099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371900788] [2024-10-11 17:56:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:24,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:56:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:56:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:56:24,286 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 2.142857142857143) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:24,316 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-10-11 17:56:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:56:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:56:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:24,340 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:56:24,340 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:56:24,342 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-10-11 17:56:24,345 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:24,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:56:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:56:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:56:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 2.057142857142857) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-10-11 17:56:24,374 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 4 [2024-10-11 17:56:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-10-11 17:56:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-10-11 17:56:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:56:24,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:24,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:56:24,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:56:24,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:24,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1323128715, now seen corresponding path program 1 times [2024-10-11 17:56:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477891716] [2024-10-11 17:56:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477891716] [2024-10-11 17:56:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477891716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:24,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:24,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:56:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325428576] [2024-10-11 17:56:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:24,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:56:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:56:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:24,518 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:24,622 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2024-10-11 17:56:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:56:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:56:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:24,626 INFO L225 Difference]: With dead ends: 92 [2024-10-11 17:56:24,626 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 17:56:24,627 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-10-11 17:56:24,628 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:24,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 170 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 17:56:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2024-10-11 17:56:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 70 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2024-10-11 17:56:24,645 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 6 [2024-10-11 17:56:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:24,646 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2024-10-11 17:56:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-10-11 17:56:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:56:24,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:24,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:56:24,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:56:24,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:24,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1323188297, now seen corresponding path program 1 times [2024-10-11 17:56:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594526339] [2024-10-11 17:56:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594526339] [2024-10-11 17:56:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594526339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:24,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:24,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731710661] [2024-10-11 17:56:24,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:24,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:24,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:24,732 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:24,788 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2024-10-11 17:56:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:56:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:24,790 INFO L225 Difference]: With dead ends: 113 [2024-10-11 17:56:24,790 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 17:56:24,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:24,791 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:24,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:56:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 17:56:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-10-11 17:56:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 2.051948051948052) internal successors, (158), 96 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 158 transitions. [2024-10-11 17:56:24,808 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 158 transitions. Word has length 6 [2024-10-11 17:56:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 158 transitions. [2024-10-11 17:56:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 158 transitions. [2024-10-11 17:56:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:56:24,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:24,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:24,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:56:24,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1930837147, now seen corresponding path program 1 times [2024-10-11 17:56:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863622163] [2024-10-11 17:56:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863622163] [2024-10-11 17:56:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863622163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:56:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268308154] [2024-10-11 17:56:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:24,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:24,884 INFO L87 Difference]: Start difference. First operand 97 states and 158 transitions. Second operand has 3 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-10-11 17:56:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:24,966 INFO L93 Difference]: Finished difference Result 182 states and 296 transitions. [2024-10-11 17:56:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-10-11 17:56:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:24,968 INFO L225 Difference]: With dead ends: 182 [2024-10-11 17:56:24,968 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 17:56:24,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:24,970 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 57 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:24,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 103 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 17:56:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2024-10-11 17:56:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 140 states have (on average 2.0142857142857142) internal successors, (282), 159 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2024-10-11 17:56:24,992 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 7 [2024-10-11 17:56:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2024-10-11 17:56:24,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-10-11 17:56:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2024-10-11 17:56:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:56:24,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:24,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:56:24,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1930894162, now seen corresponding path program 1 times [2024-10-11 17:56:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267691465] [2024-10-11 17:56:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267691465] [2024-10-11 17:56:25,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267691465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:25,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:25,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064313410] [2024-10-11 17:56:25,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:25,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:25,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:25,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:25,126 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:25,197 INFO L93 Difference]: Finished difference Result 240 states and 400 transitions. [2024-10-11 17:56:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:56:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:25,199 INFO L225 Difference]: With dead ends: 240 [2024-10-11 17:56:25,202 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 17:56:25,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:25,203 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 61 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:25,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 142 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 17:56:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2024-10-11 17:56:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 202 states have (on average 1.9158415841584158) internal successors, (387), 219 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2024-10-11 17:56:25,228 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 7 [2024-10-11 17:56:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2024-10-11 17:56:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2024-10-11 17:56:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:56:25,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:25,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:25,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:56:25,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:25,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1930894161, now seen corresponding path program 1 times [2024-10-11 17:56:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:25,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370974990] [2024-10-11 17:56:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:25,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370974990] [2024-10-11 17:56:25,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370974990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:25,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:25,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370536765] [2024-10-11 17:56:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:25,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:25,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:25,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:25,354 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:25,409 INFO L93 Difference]: Finished difference Result 235 states and 387 transitions. [2024-10-11 17:56:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:25,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:56:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:25,411 INFO L225 Difference]: With dead ends: 235 [2024-10-11 17:56:25,414 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 17:56:25,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:25,416 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 60 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:25,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 148 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 17:56:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 218. [2024-10-11 17:56:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 202 states have (on average 1.8564356435643565) internal successors, (375), 217 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 375 transitions. [2024-10-11 17:56:25,433 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 375 transitions. Word has length 7 [2024-10-11 17:56:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:25,433 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 375 transitions. [2024-10-11 17:56:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 375 transitions. [2024-10-11 17:56:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:56:25,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:25,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:25,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:56:25,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:25,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 271831126, now seen corresponding path program 1 times [2024-10-11 17:56:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:25,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404261417] [2024-10-11 17:56:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:25,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404261417] [2024-10-11 17:56:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404261417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:56:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173110891] [2024-10-11 17:56:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:56:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:56:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:25,479 INFO L87 Difference]: Start difference. First operand 218 states and 375 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:25,521 INFO L93 Difference]: Finished difference Result 183 states and 280 transitions. [2024-10-11 17:56:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:56:25,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:56:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:25,523 INFO L225 Difference]: With dead ends: 183 [2024-10-11 17:56:25,523 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 17:56:25,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:25,524 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:25,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:56:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 17:56:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2024-10-11 17:56:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.777027027027027) internal successors, (263), 159 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 263 transitions. [2024-10-11 17:56:25,530 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 263 transitions. Word has length 8 [2024-10-11 17:56:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:25,530 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 263 transitions. [2024-10-11 17:56:25,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 263 transitions. [2024-10-11 17:56:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:56:25,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:25,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:56:25,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:25,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash -111813905, now seen corresponding path program 1 times [2024-10-11 17:56:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885859925] [2024-10-11 17:56:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:56:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885859925] [2024-10-11 17:56:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885859925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:25,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:56:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942457624] [2024-10-11 17:56:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:25,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:56:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:56:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:25,575 INFO L87 Difference]: Start difference. First operand 160 states and 263 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:25,612 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-10-11 17:56:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:56:25,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:56:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:25,613 INFO L225 Difference]: With dead ends: 239 [2024-10-11 17:56:25,614 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 17:56:25,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:25,615 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:25,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:56:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 17:56:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2024-10-11 17:56:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 212 states have (on average 1.6886792452830188) internal successors, (358), 223 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 358 transitions. [2024-10-11 17:56:25,621 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 358 transitions. Word has length 9 [2024-10-11 17:56:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:25,623 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 358 transitions. [2024-10-11 17:56:25,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 358 transitions. [2024-10-11 17:56:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:56:25,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:25,624 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:25,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:56:25,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -923788485, now seen corresponding path program 1 times [2024-10-11 17:56:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304096534] [2024-10-11 17:56:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:56:25,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:56:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:56:25,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:56:25,693 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:56:25,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-10-11 17:56:25,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-10-11 17:56:25,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-10-11 17:56:25,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-10-11 17:56:25,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-10-11 17:56:25,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-10-11 17:56:25,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-10-11 17:56:25,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-10-11 17:56:25,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-10-11 17:56:25,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-10-11 17:56:25,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-10-11 17:56:25,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-10-11 17:56:25,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-10-11 17:56:25,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:56:25,706 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:25,742 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:56:25,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:56:25 BoogieIcfgContainer [2024-10-11 17:56:25,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:56:25,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:56:25,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:56:25,747 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:56:25,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:23" (3/4) ... [2024-10-11 17:56:25,750 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:56:25,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:56:25,751 INFO L158 Benchmark]: Toolchain (without parser) took 2919.19ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 127.2MB in the beginning and 103.7MB in the end (delta: 23.5MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-10-11 17:56:25,751 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:56:25,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.71ms. Allocated memory is still 184.5MB. Free memory was 127.2MB in the beginning and 107.7MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:56:25,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.34ms. Allocated memory is still 184.5MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:56:25,752 INFO L158 Benchmark]: Boogie Preprocessor took 52.64ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 102.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:56:25,753 INFO L158 Benchmark]: RCFGBuilder took 526.51ms. Allocated memory is still 184.5MB. Free memory was 102.8MB in the beginning and 80.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:56:25,753 INFO L158 Benchmark]: TraceAbstraction took 1765.22ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 80.1MB in the beginning and 103.7MB in the end (delta: -23.6MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-10-11 17:56:25,753 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 241.2MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:56:25,755 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.14ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.71ms. Allocated memory is still 184.5MB. Free memory was 127.2MB in the beginning and 107.7MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.34ms. Allocated memory is still 184.5MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.64ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 102.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 526.51ms. Allocated memory is still 184.5MB. Free memory was 102.8MB in the beginning and 80.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1765.22ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 80.1MB in the beginning and 103.7MB in the end (delta: -23.6MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 241.2MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1059 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 558 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=8, InterpolantAutomatonStates: 26, 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, 8 MinimizatonAttempts, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-10-11 17:56:25,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:56:27,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:56:27,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 17:56:28,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:56:28,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:56:28,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:56:28,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:56:28,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:56:28,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:56:28,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:56:28,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:56:28,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:56:28,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:56:28,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:56:28,041 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:56:28,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:56:28,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:56:28,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:56:28,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:56:28,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:56:28,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:56:28,044 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:56:28,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:56:28,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:56:28,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:56:28,045 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:56:28,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:56:28,045 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:56:28,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:56:28,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:56:28,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:56:28,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:56:28,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:56:28,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:56:28,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:56:28,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:28,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:56:28,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:56:28,048 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:56:28,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:56:28,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:56:28,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:56:28,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:56:28,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:56:28,050 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:56:28,050 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-clean/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-clean/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 -> 31ec15b2e966aee42d8cde3b6798712776e0e885e8b3f5267212ea76fdd72bb4 [2024-10-11 17:56:28,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:56:28,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:56:28,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:56:28,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:56:28,383 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:56:28,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-10-11 17:56:29,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:56:30,172 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:56:30,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.2.i [2024-10-11 17:56:30,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6ce7e5eac/988d7f08fc3841d3b3d8aad0469e7559/FLAG684327a93 [2024-10-11 17:56:30,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6ce7e5eac/988d7f08fc3841d3b3d8aad0469e7559 [2024-10-11 17:56:30,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:56:30,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:56:30,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:56:30,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:56:30,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:56:30,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b62fce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30, skipping insertion in model container [2024-10-11 17:56:30,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:56:30,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:56:30,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:56:30,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:56:30,709 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:56:30,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30 WrapperNode [2024-10-11 17:56:30,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:56:30,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:56:30,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:56:30,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:56:30,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,759 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-10-11 17:56:30,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:56:30,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:56:30,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:56:30,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:56:30,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,799 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-11 17:56:30,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:56:30,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:56:30,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:56:30,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:56:30,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (1/1) ... [2024-10-11 17:56:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:56:30,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:56:30,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:56:30,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:56:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:56:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:56:30,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:56:31,031 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:56:31,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:56:31,372 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 17:56:31,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:56:31,418 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:56:31,418 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:56:31,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:31 BoogieIcfgContainer [2024-10-11 17:56:31,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:56:31,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:56:31,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:56:31,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:56:31,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:56:30" (1/3) ... [2024-10-11 17:56:31,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cd23ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:31, skipping insertion in model container [2024-10-11 17:56:31,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:30" (2/3) ... [2024-10-11 17:56:31,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cd23ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:31, skipping insertion in model container [2024-10-11 17:56:31,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:31" (3/3) ... [2024-10-11 17:56:31,429 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2.i [2024-10-11 17:56:31,443 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:56:31,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 17:56:31,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:56:31,495 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;@4be7b39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:56:31,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:56:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 2.142857142857143) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:56:31,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:31,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:56:31,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:31,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 5969409, now seen corresponding path program 1 times [2024-10-11 17:56:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613869935] [2024-10-11 17:56:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:31,526 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-10-11 17:56:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:31,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 17:56:31,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:31,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:56:31,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:31,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:31,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613869935] [2024-10-11 17:56:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613869935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:31,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914839643] [2024-10-11 17:56:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:56:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:56:31,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:56:31,655 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 2.142857142857143) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:31,697 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-10-11 17:56:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:56:31,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:56:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:31,708 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:56:31,709 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:56:31,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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-10-11 17:56:31,715 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:31,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:56:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:56:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:56:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 2.057142857142857) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-10-11 17:56:31,750 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 4 [2024-10-11 17:56:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:31,751 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-10-11 17:56:31,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-10-11 17:56:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:56:31,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:31,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:56:31,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:31,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 17:56:31,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:31,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1323128715, now seen corresponding path program 1 times [2024-10-11 17:56:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:31,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925347977] [2024-10-11 17:56:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:31,958 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-10-11 17:56:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:31,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 17:56:31,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:32,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:56:32,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:32,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:32,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925347977] [2024-10-11 17:56:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925347977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:32,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:56:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840189427] [2024-10-11 17:56:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:32,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:56:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:56:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:32,096 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:32,219 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2024-10-11 17:56:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:56:32,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:56:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:32,222 INFO L225 Difference]: With dead ends: 92 [2024-10-11 17:56:32,222 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 17:56:32,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-11 17:56:32,224 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:32,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 170 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 17:56:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2024-10-11 17:56:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 70 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2024-10-11 17:56:32,239 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 6 [2024-10-11 17:56:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:32,239 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2024-10-11 17:56:32,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-10-11 17:56:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:56:32,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:32,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:56:32,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 17:56:32,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 17:56:32,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:32,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1323188297, now seen corresponding path program 1 times [2024-10-11 17:56:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010002575] [2024-10-11 17:56:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:32,450 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-10-11 17:56:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:32,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 17:56:32,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:32,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:56:32,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:32,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:32,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010002575] [2024-10-11 17:56:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010002575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:32,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:32,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:32,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683062481] [2024-10-11 17:56:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:32,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:32,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:32,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:32,555 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:32,623 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2024-10-11 17:56:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:32,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:56:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:32,627 INFO L225 Difference]: With dead ends: 113 [2024-10-11 17:56:32,627 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 17:56:32,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:32,628 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:32,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 17:56:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-10-11 17:56:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 2.051948051948052) internal successors, (158), 96 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 158 transitions. [2024-10-11 17:56:32,637 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 158 transitions. Word has length 6 [2024-10-11 17:56:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:32,637 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 158 transitions. [2024-10-11 17:56:32,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 158 transitions. [2024-10-11 17:56:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:56:32,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:32,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:32,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:32,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 17:56:32,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1930837147, now seen corresponding path program 1 times [2024-10-11 17:56:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412257859] [2024-10-11 17:56:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:32,843 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-10-11 17:56:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:32,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 17:56:32,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:32,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:56:32,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:32,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:32,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412257859] [2024-10-11 17:56:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412257859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:32,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:56:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856570572] [2024-10-11 17:56:32,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:32,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:32,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:32,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:32,916 INFO L87 Difference]: Start difference. First operand 97 states and 158 transitions. Second operand has 3 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-10-11 17:56:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:33,036 INFO L93 Difference]: Finished difference Result 182 states and 296 transitions. [2024-10-11 17:56:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-10-11 17:56:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:33,038 INFO L225 Difference]: With dead ends: 182 [2024-10-11 17:56:33,038 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 17:56:33,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:33,040 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 57 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:33,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 103 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 17:56:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2024-10-11 17:56:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 140 states have (on average 2.0142857142857142) internal successors, (282), 159 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2024-10-11 17:56:33,056 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 7 [2024-10-11 17:56:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:33,056 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2024-10-11 17:56:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-10-11 17:56:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2024-10-11 17:56:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:56:33,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:33,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:33,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 17:56:33,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1930894162, now seen corresponding path program 1 times [2024-10-11 17:56:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514357646] [2024-10-11 17:56:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:33,259 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-10-11 17:56:33,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:33,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 17:56:33,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:33,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:56:33,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:33,345 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-10-11 17:56:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:33,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:33,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:33,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514357646] [2024-10-11 17:56:33,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514357646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:33,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:33,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368345262] [2024-10-11 17:56:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:33,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:33,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:33,362 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:33,520 INFO L93 Difference]: Finished difference Result 240 states and 400 transitions. [2024-10-11 17:56:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:33,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:56:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:33,522 INFO L225 Difference]: With dead ends: 240 [2024-10-11 17:56:33,522 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 17:56:33,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:33,523 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 61 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:33,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 142 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:56:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 17:56:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2024-10-11 17:56:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 202 states have (on average 1.9158415841584158) internal successors, (387), 219 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2024-10-11 17:56:33,536 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 7 [2024-10-11 17:56:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:33,537 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2024-10-11 17:56:33,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2024-10-11 17:56:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:56:33,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:33,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:33,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:33,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 17:56:33,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1930894161, now seen corresponding path program 1 times [2024-10-11 17:56:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205975465] [2024-10-11 17:56:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:33,740 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-10-11 17:56:33,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:33,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 17:56:33,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:33,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:56:33,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:33,807 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-10-11 17:56:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:33,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:33,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205975465] [2024-10-11 17:56:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205975465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:33,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:56:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141057942] [2024-10-11 17:56:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:33,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:56:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:56:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:33,817 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:33,929 INFO L93 Difference]: Finished difference Result 235 states and 387 transitions. [2024-10-11 17:56:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:56:33,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:56:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:33,930 INFO L225 Difference]: With dead ends: 235 [2024-10-11 17:56:33,931 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 17:56:33,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:56:33,932 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 60 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:33,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 148 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 17:56:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 218. [2024-10-11 17:56:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 202 states have (on average 1.8564356435643565) internal successors, (375), 217 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 375 transitions. [2024-10-11 17:56:33,960 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 375 transitions. Word has length 7 [2024-10-11 17:56:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:33,960 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 375 transitions. [2024-10-11 17:56:33,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 375 transitions. [2024-10-11 17:56:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:56:33,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:33,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:33,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:34,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 17:56:34,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash 271831126, now seen corresponding path program 1 times [2024-10-11 17:56:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349593020] [2024-10-11 17:56:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:34,163 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-10-11 17:56:34,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:34,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 17:56:34,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:34,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:56:34,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:34,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:34,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349593020] [2024-10-11 17:56:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349593020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:34,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:56:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776361347] [2024-10-11 17:56:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:56:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:56:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:34,230 INFO L87 Difference]: Start difference. First operand 218 states and 375 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:34,295 INFO L93 Difference]: Finished difference Result 183 states and 280 transitions. [2024-10-11 17:56:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:56:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:56:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:34,296 INFO L225 Difference]: With dead ends: 183 [2024-10-11 17:56:34,296 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 17:56:34,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:34,297 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:34,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 17:56:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2024-10-11 17:56:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.777027027027027) internal successors, (263), 159 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 263 transitions. [2024-10-11 17:56:34,304 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 263 transitions. Word has length 8 [2024-10-11 17:56:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:34,304 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 263 transitions. [2024-10-11 17:56:34,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 263 transitions. [2024-10-11 17:56:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:56:34,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:34,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:34,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 17:56:34,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -111813905, now seen corresponding path program 1 times [2024-10-11 17:56:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116375941] [2024-10-11 17:56:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:34,507 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-10-11 17:56:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:34,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 17:56:34,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:56:34,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:56:34,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:56:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:34,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:56:34,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:56:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116375941] [2024-10-11 17:56:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116375941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:56:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:56:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:56:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120903671] [2024-10-11 17:56:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:56:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:56:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:56:34,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:56:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:34,574 INFO L87 Difference]: Start difference. First operand 160 states and 263 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:34,632 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-10-11 17:56:34,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:56:34,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:56:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:34,634 INFO L225 Difference]: With dead ends: 239 [2024-10-11 17:56:34,635 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 17:56:34,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:56:34,635 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:34,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:56:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 17:56:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2024-10-11 17:56:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 212 states have (on average 1.6886792452830188) internal successors, (358), 223 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 358 transitions. [2024-10-11 17:56:34,657 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 358 transitions. Word has length 9 [2024-10-11 17:56:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:34,657 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 358 transitions. [2024-10-11 17:56:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:56:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 358 transitions. [2024-10-11 17:56:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:56:34,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:34,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:34,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 17:56:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 17:56:34,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 17:56:34,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -923788485, now seen corresponding path program 1 times [2024-10-11 17:56:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:56:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681452350] [2024-10-11 17:56:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:34,862 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-10-11 17:56:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:56:34,863 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 17:56:34,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:56:34,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:56:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:56:35,006 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 17:56:35,006 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:56:35,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-10-11 17:56:35,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-10-11 17:56:35,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-10-11 17:56:35,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-10-11 17:56:35,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-10-11 17:56:35,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-10-11 17:56:35,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-10-11 17:56:35,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-10-11 17:56:35,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-10-11 17:56:35,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-10-11 17:56:35,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-10-11 17:56:35,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-10-11 17:56:35,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-10-11 17:56:35,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-10-11 17:56:35,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-10-11 17:56:35,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-10-11 17:56:35,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-10-11 17:56:35,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-10-11 17:56:35,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-10-11 17:56:35,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-10-11 17:56:35,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 17:56:35,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 17:56:35,221 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:35,259 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:56:35,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:56:35 BoogieIcfgContainer [2024-10-11 17:56:35,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:56:35,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:56:35,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:56:35,264 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:56:35,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:31" (3/4) ... [2024-10-11 17:56:35,267 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:56:35,268 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:56:35,268 INFO L158 Benchmark]: Toolchain (without parser) took 5059.68ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.9MB in the beginning and 35.1MB in the end (delta: 1.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-11 17:56:35,268 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 46.1MB. Free memory was 26.9MB in the beginning and 26.9MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:56:35,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.54ms. Allocated memory is still 60.8MB. Free memory was 36.7MB in the beginning and 33.2MB in the end (delta: 3.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:56:35,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.34ms. Allocated memory is still 60.8MB. Free memory was 33.2MB in the beginning and 31.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:56:35,269 INFO L158 Benchmark]: Boogie Preprocessor took 56.51ms. Allocated memory is still 60.8MB. Free memory was 31.0MB in the beginning and 27.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:56:35,269 INFO L158 Benchmark]: RCFGBuilder took 601.28ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.9MB in the beginning and 31.4MB in the end (delta: -3.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-11 17:56:35,270 INFO L158 Benchmark]: TraceAbstraction took 3842.45ms. Allocated memory is still 73.4MB. Free memory was 31.0MB in the beginning and 35.6MB in the end (delta: -4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:56:35,270 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 73.4MB. Free memory was 35.6MB in the beginning and 35.1MB in the end (delta: 474.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:56:35,272 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.19ms. Allocated memory is still 46.1MB. Free memory was 26.9MB in the beginning and 26.9MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.54ms. Allocated memory is still 60.8MB. Free memory was 36.7MB in the beginning and 33.2MB in the end (delta: 3.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.34ms. Allocated memory is still 60.8MB. Free memory was 33.2MB in the beginning and 31.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.51ms. Allocated memory is still 60.8MB. Free memory was 31.0MB in the beginning and 27.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 601.28ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.9MB in the beginning and 31.4MB in the end (delta: -3.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3842.45ms. Allocated memory is still 73.4MB. Free memory was 31.0MB in the beginning and 35.6MB in the end (delta: -4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 73.4MB. Free memory was 35.6MB in the beginning and 35.1MB in the end (delta: 474.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L538] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() [L594] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1059 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 558 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=8, InterpolantAutomatonStates: 26, 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, 8 MinimizatonAttempts, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 5 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-10-11 17:56:35,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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