./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --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/recursive-with-pointer/simple-recursive.c -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 e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:22:46,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:22:46,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:22:46,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:22:46,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:22:46,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:22:46,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:22:46,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:22:46,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:22:46,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:22:46,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:22:46,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:22:46,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:22:46,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:22:46,328 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:22:46,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:22:46,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:22:46,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:22:46,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:22:46,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:22:46,330 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:22:46,334 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:22:46,335 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:22:46,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:22:46,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:22:46,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:22:46,336 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:22:46,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:22:46,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:22:46,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:22:46,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:22:46,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:22:46,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:22:46,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:22:46,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:22:46,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:22:46,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:22:46,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:22:46,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:22:46,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:22:46,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:22:46,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:22:46,344 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 -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2024-10-11 18:22:46,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:22:46,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:22:46,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:22:46,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:22:46,694 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:22:46,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-10-11 18:22:48,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:22:48,401 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:22:48,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-10-11 18:22:48,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d1521e18/af98184ffb544f88b278b4fbdb934888/FLAGdd4bbcd34 [2024-10-11 18:22:48,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d1521e18/af98184ffb544f88b278b4fbdb934888 [2024-10-11 18:22:48,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:22:48,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:22:48,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:22:48,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:22:48,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:22:48,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734f2e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48, skipping insertion in model container [2024-10-11 18:22:48,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:22:48,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:22:48,678 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:22:48,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:22:48,717 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:22:48,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48 WrapperNode [2024-10-11 18:22:48,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:22:48,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:22:48,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:22:48,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:22:48,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,752 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-10-11 18:22:48,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:22:48,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:22:48,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:22:48,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:22:48,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,784 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-10-11 18:22:48,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:22:48,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:22:48,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:22:48,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:22:48,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (1/1) ... [2024-10-11 18:22:48,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:22:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:22:48,853 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 18:22:48,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 18:22:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:22:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-10-11 18:22:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-10-11 18:22:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:22:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:22:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:22:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-10-11 18:22:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-10-11 18:22:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:22:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:22:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:22:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:22:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:22:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:22:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:22:48,984 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:22:48,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:22:49,186 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 18:22:49,186 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:22:49,217 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:22:49,217 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 18:22:49,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:49 BoogieIcfgContainer [2024-10-11 18:22:49,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:22:49,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:22:49,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:22:49,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:22:49,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:22:48" (1/3) ... [2024-10-11 18:22:49,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4b287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:49, skipping insertion in model container [2024-10-11 18:22:49,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:48" (2/3) ... [2024-10-11 18:22:49,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4b287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:49, skipping insertion in model container [2024-10-11 18:22:49,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:49" (3/3) ... [2024-10-11 18:22:49,230 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-10-11 18:22:49,247 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:22:49,247 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 18:22:49,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:22:49,292 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;@27bafaec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:22:49,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 18:22:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:22:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:22:49,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:49,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:22:49,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:49,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2726, now seen corresponding path program 1 times [2024-10-11 18:22:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317333858] [2024-10-11 18:22:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:49,570 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 18:22:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317333858] [2024-10-11 18:22:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317333858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:22:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112814017] [2024-10-11 18:22:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:49,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:22:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:22:49,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:22:49,613 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 18:22:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:49,686 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-10-11 18:22:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:22:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 18:22:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:49,697 INFO L225 Difference]: With dead ends: 32 [2024-10-11 18:22:49,697 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 18:22:49,700 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 18:22:49,704 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:49,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:22:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 18:22:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 18:22:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 26 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:22:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-11 18:22:49,742 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 2 [2024-10-11 18:22:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:49,743 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-11 18:22:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 18:22:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-10-11 18:22:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:22:49,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:49,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:22:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:22:49,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2727, now seen corresponding path program 1 times [2024-10-11 18:22:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374116583] [2024-10-11 18:22:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:49,904 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 18:22:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374116583] [2024-10-11 18:22:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374116583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:22:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591230809] [2024-10-11 18:22:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:22:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:22:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:22:49,910 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 18:22:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:49,942 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-11 18:22:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:22:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 18:22:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:49,945 INFO L225 Difference]: With dead ends: 30 [2024-10-11 18:22:49,945 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 18:22:49,945 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 18:22:49,946 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:49,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:22:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 18:22:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 18:22:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 25 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:22:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-11 18:22:49,956 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 2 [2024-10-11 18:22:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:49,957 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-11 18:22:49,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 18:22:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-11 18:22:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:22:49,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:49,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:22:49,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:22:49,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:49,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 81228527, now seen corresponding path program 1 times [2024-10-11 18:22:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:49,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18488739] [2024-10-11 18:22:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:50,077 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 18:22:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18488739] [2024-10-11 18:22:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18488739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:50,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:22:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089093854] [2024-10-11 18:22:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:22:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:22:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:22:50,083 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:50,198 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-10-11 18:22:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:22:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:22:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:50,202 INFO L225 Difference]: With dead ends: 45 [2024-10-11 18:22:50,203 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 18:22:50,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:22:50,205 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:50,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 53 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:22:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 18:22:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2024-10-11 18:22:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.619047619047619) internal successors, (34), 31 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:22:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 18:22:50,220 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 5 [2024-10-11 18:22:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 18:22:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 18:22:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:22:50,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:50,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:22:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:22:50,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash 81228528, now seen corresponding path program 1 times [2024-10-11 18:22:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112433478] [2024-10-11 18:22:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:50,410 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 18:22:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:50,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112433478] [2024-10-11 18:22:50,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112433478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:50,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:50,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:22:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068524860] [2024-10-11 18:22:50,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:22:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:22:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:22:50,415 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:50,514 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-10-11 18:22:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:22:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:22:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:50,516 INFO L225 Difference]: With dead ends: 41 [2024-10-11 18:22:50,517 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 18:22:50,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:22:50,519 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:50,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:22:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 18:22:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-10-11 18:22:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 31 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:22:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-10-11 18:22:50,530 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 5 [2024-10-11 18:22:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:50,531 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-10-11 18:22:50,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-10-11 18:22:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:22:50,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:50,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:22:50,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:22:50,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:50,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash 350994170, now seen corresponding path program 1 times [2024-10-11 18:22:50,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767236183] [2024-10-11 18:22:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:50,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:50,664 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 18:22:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767236183] [2024-10-11 18:22:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767236183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:22:50,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050359646] [2024-10-11 18:22:50,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:50,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:22:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:22:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:22:50,668 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:50,793 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-11 18:22:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:22:50,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 18:22:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:50,794 INFO L225 Difference]: With dead ends: 38 [2024-10-11 18:22:50,795 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 18:22:50,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:22:50,796 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:50,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:22:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 18:22:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-10-11 18:22:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.380952380952381) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:22:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-11 18:22:50,801 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2024-10-11 18:22:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:50,802 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-11 18:22:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-11 18:22:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:22:50,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:50,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:22:50,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:22:50,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:50,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 350994171, now seen corresponding path program 1 times [2024-10-11 18:22:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242692461] [2024-10-11 18:22:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:51,003 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 18:22:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242692461] [2024-10-11 18:22:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242692461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:22:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84969284] [2024-10-11 18:22:51,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:51,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:22:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:22:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:22:51,006 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:51,116 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-10-11 18:22:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:22:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 18:22:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:51,118 INFO L225 Difference]: With dead ends: 34 [2024-10-11 18:22:51,118 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 18:22:51,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:22:51,119 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:51,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:22:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 18:22:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-10-11 18:22:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:22:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-11 18:22:51,124 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2024-10-11 18:22:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:51,125 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-11 18:22:51,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-10-11 18:22:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:22:51,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:51,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:22:51,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:22:51,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:51,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash 351047532, now seen corresponding path program 1 times [2024-10-11 18:22:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667479518] [2024-10-11 18:22:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:51,207 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 18:22:51,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667479518] [2024-10-11 18:22:51,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667479518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:22:51,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:22:51,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:22:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069620277] [2024-10-11 18:22:51,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:22:51,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:22:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:22:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:22:51,210 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:51,278 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-11 18:22:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:22:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 18:22:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:51,279 INFO L225 Difference]: With dead ends: 28 [2024-10-11 18:22:51,280 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 18:22:51,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:22:51,281 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:51,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:22:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 18:22:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 18:22:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:22:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-11 18:22:51,286 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 9 [2024-10-11 18:22:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:51,286 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-11 18:22:51,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-11 18:22:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:22:51,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:51,287 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:22:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:22:51,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1072831909, now seen corresponding path program 1 times [2024-10-11 18:22:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266323491] [2024-10-11 18:22:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266323491] [2024-10-11 18:22:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266323491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:22:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310716] [2024-10-11 18:22:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:51,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:22:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:22:51,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:22:51,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:22:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:51,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:22:51,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:22:51,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:22:52,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:22:52,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:22:52,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2024-10-11 18:22:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:52,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:22:53,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-10-11 18:22:53,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:22:53,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 184 [2024-10-11 18:22:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:22:53,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:22:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 35 [2024-10-11 18:22:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149223760] [2024-10-11 18:22:53,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:22:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:22:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:22:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 18:22:53,359 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 35 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:54,632 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-10-11 18:22:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 18:22:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:22:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:54,636 INFO L225 Difference]: With dead ends: 50 [2024-10-11 18:22:54,637 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 18:22:54,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=2472, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 18:22:54,640 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:54,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 181 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:22:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 18:22:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-10-11 18:22:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-11 18:22:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-10-11 18:22:54,656 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 17 [2024-10-11 18:22:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:54,656 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-10-11 18:22:54,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-10-11 18:22:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:22:54,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:54,657 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:22:54,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:22:54,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:22:54,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1052925719, now seen corresponding path program 2 times [2024-10-11 18:22:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705808709] [2024-10-11 18:22:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:55,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:55,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705808709] [2024-10-11 18:22:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705808709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:22:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103013859] [2024-10-11 18:22:55,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:22:55,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:22:55,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:22:55,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:22:55,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:22:55,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:22:55,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:22:55,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-11 18:22:55,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:22:55,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:22:55,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 18:22:55,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 18:22:55,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 18:22:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:55,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:22:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103013859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:22:56,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:22:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 24] total 48 [2024-10-11 18:22:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157765751] [2024-10-11 18:22:56,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:22:56,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 18:22:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:22:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 18:22:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2000, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 18:22:56,523 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 48 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 34 states have internal predecessors, (58), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:22:57,481 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-10-11 18:22:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-11 18:22:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 34 states have internal predecessors, (58), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 18:22:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:22:57,484 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:22:57,484 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:22:57,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=732, Invalid=5120, Unknown=0, NotChecked=0, Total=5852 [2024-10-11 18:22:57,490 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:22:57,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 223 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:22:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:22:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-11 18:22:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 15 states have call successors, (15), 15 states have call predecessors, (15), 5 states have return successors, (17), 5 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-11 18:22:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-10-11 18:22:57,506 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 33 [2024-10-11 18:22:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:22:57,507 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-10-11 18:22:57,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 34 states have internal predecessors, (58), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:22:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-10-11 18:22:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 18:22:57,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:22:57,509 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:22:57,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:22:57,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:22:57,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:22:57,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:22:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash 976451067, now seen corresponding path program 3 times [2024-10-11 18:22:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:22:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715173662] [2024-10-11 18:22:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:22:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:22:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:22:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:22:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:22:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715173662] [2024-10-11 18:22:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715173662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:22:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587525602] [2024-10-11 18:22:59,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 18:22:59,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:22:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:22:59,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:22:59,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:22:59,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 18:22:59,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:22:59,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:22:59,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:23:00,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 18:23:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-11 18:23:00,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:23:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-11 18:23:00,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587525602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:23:00,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:23:00,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 13, 13] total 56 [2024-10-11 18:23:00,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038456052] [2024-10-11 18:23:00,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:23:00,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-11 18:23:00,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:23:00,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-11 18:23:00,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2771, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 18:23:00,537 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 56 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:23:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:23:01,722 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-10-11 18:23:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-11 18:23:01,723 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 18:23:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:23:01,728 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:23:01,730 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:23:01,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1107, Invalid=7635, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 18:23:01,733 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 114 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:23:01,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 238 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:23:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:23:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-11 18:23:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 17 states have call successors, (17), 17 states have call predecessors, (17), 5 states have return successors, (19), 5 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-11 18:23:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-10-11 18:23:01,749 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 65 [2024-10-11 18:23:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:23:01,750 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-10-11 18:23:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:23:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-10-11 18:23:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 18:23:01,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:23:01,756 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:23:01,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:23:01,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:23:01,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:23:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:23:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1069249261, now seen corresponding path program 1 times [2024-10-11 18:23:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:23:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917173718] [2024-10-11 18:23:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:23:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:23:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:23:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:04,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 22 proven. 128 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-11 18:23:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:23:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917173718] [2024-10-11 18:23:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917173718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:23:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380141126] [2024-10-11 18:23:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:23:11,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:23:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:23:11,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:23:11,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:23:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:11,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 200 conjuncts are in the unsatisfiable core [2024-10-11 18:23:11,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:23:11,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:23:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-11 18:23:12,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:23:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:23:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380141126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:23:26,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:23:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 71] total 103 [2024-10-11 18:23:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502737536] [2024-10-11 18:23:26,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:23:26,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-10-11 18:23:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:23:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-10-11 18:23:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1310, Invalid=9196, Unknown=0, NotChecked=0, Total=10506 [2024-10-11 18:23:26,938 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 103 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 85 states have internal predecessors, (111), 22 states have call successors, (22), 18 states have call predecessors, (22), 36 states have return successors, (51), 35 states have call predecessors, (51), 22 states have call successors, (51) [2024-10-11 18:23:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:23:27,650 INFO L93 Difference]: Finished difference Result 123 states and 212 transitions. [2024-10-11 18:23:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 18:23:27,652 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 85 states have internal predecessors, (111), 22 states have call successors, (22), 18 states have call predecessors, (22), 36 states have return successors, (51), 35 states have call predecessors, (51), 22 states have call successors, (51) Word has length 108 [2024-10-11 18:23:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:23:27,658 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:23:27,662 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:23:27,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 170 SyntacticMatches, 15 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7003 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1686, Invalid=10970, Unknown=0, NotChecked=0, Total=12656 [2024-10-11 18:23:27,669 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:23:27,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 334 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:23:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:23:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-11 18:23:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 17 states have call successors, (17), 17 states have call predecessors, (17), 21 states have return successors, (77), 21 states have call predecessors, (77), 17 states have call successors, (77) [2024-10-11 18:23:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2024-10-11 18:23:27,701 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 108 [2024-10-11 18:23:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:23:27,701 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2024-10-11 18:23:27,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 85 states have internal predecessors, (111), 22 states have call successors, (22), 18 states have call predecessors, (22), 36 states have return successors, (51), 35 states have call predecessors, (51), 22 states have call successors, (51) [2024-10-11 18:23:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2024-10-11 18:23:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 18:23:27,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:23:27,707 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:23:27,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:23:27,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:23:27,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-11 18:23:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:23:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1173622471, now seen corresponding path program 2 times [2024-10-11 18:23:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:23:27,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95781805] [2024-10-11 18:23:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:23:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:23:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 18:23:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 18:23:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:23:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-10-11 18:23:28,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:23:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95781805] [2024-10-11 18:23:28,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95781805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:23:28,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:23:28,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:23:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790806057] [2024-10-11 18:23:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:23:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:23:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:23:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:23:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:23:28,415 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:23:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:23:28,441 INFO L93 Difference]: Finished difference Result 116 states and 172 transitions. [2024-10-11 18:23:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:23:28,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 132 [2024-10-11 18:23:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:23:28,443 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:23:28,443 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 18:23:28,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:23:28,443 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:23:28,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:23:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 18:23:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 18:23:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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 18:23:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 18:23:28,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2024-10-11 18:23:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:23:28,444 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 18:23:28,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:23:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 18:23:28,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 18:23:28,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2024-10-11 18:23:28,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2024-10-11 18:23:28,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2024-10-11 18:23:28,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2024-10-11 18:23:28,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr4ASSERT_VIOLATIONMEMORY_LEAK (7 of 12 remaining) [2024-10-11 18:23:28,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2024-10-11 18:23:28,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2024-10-11 18:23:28,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 12 remaining) [2024-10-11 18:23:28,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2024-10-11 18:23:28,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2024-10-11 18:23:28,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2024-10-11 18:23:28,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2024-10-11 18:23:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:23:28,454 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:23:28,456 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:23:28,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:23:28 BoogieIcfgContainer [2024-10-11 18:23:28,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:23:28,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:23:28,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:23:28,461 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:23:28,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:49" (3/4) ... [2024-10-11 18:23:28,464 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 18:23:28,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-10-11 18:23:28,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2024-10-11 18:23:28,473 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 18:23:28,473 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 18:23:28,474 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 18:23:28,474 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 18:23:28,474 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 18:23:28,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 18:23:28,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 18:23:28,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:23:28,583 INFO L158 Benchmark]: Toolchain (without parser) took 40158.10ms. Allocated memory was 169.9MB in the beginning and 750.8MB in the end (delta: 580.9MB). Free memory was 131.7MB in the beginning and 708.7MB in the end (delta: -577.0MB). Peak memory consumption was 444.1MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,583 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 169.9MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:23:28,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.49ms. Allocated memory is still 169.9MB. Free memory was 131.5MB in the beginning and 130.8MB in the end (delta: 781.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.70ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 129.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,584 INFO L158 Benchmark]: Boogie Preprocessor took 47.20ms. Allocated memory is still 169.9MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,585 INFO L158 Benchmark]: RCFGBuilder took 416.98ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 134.3MB in the end (delta: -6.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,585 INFO L158 Benchmark]: TraceAbstraction took 39239.86ms. Allocated memory was 169.9MB in the beginning and 750.8MB in the end (delta: 580.9MB). Free memory was 134.3MB in the beginning and 274.9MB in the end (delta: -140.5MB). Peak memory consumption was 442.4MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,585 INFO L158 Benchmark]: Witness Printer took 121.76ms. Allocated memory is still 750.8MB. Free memory was 274.9MB in the beginning and 708.7MB in the end (delta: -433.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-10-11 18:23:28,586 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.21ms. Allocated memory is still 169.9MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.49ms. Allocated memory is still 169.9MB. Free memory was 131.5MB in the beginning and 130.8MB in the end (delta: 781.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.70ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 129.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.20ms. Allocated memory is still 169.9MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.98ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 134.3MB in the end (delta: -6.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39239.86ms. Allocated memory was 169.9MB in the beginning and 750.8MB in the end (delta: 580.9MB). Free memory was 134.3MB in the beginning and 274.9MB in the end (delta: -140.5MB). Peak memory consumption was 442.4MB. Max. memory is 16.1GB. * Witness Printer took 121.76ms. Allocated memory is still 750.8MB. Free memory was 274.9MB in the beginning and 708.7MB in the end (delta: -433.8MB). Peak memory consumption was 5.5MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 1357 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1145 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2282 IncrementalHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 212 mSDtfsCounter, 2282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 767 GetRequests, 383 SyntacticMatches, 22 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10971 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=11, InterpolantAutomatonStates: 204, 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, 12 MinimizatonAttempts, 25 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 619 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 822 ConstructedInterpolants, 18 QuantifiedInterpolants, 6614 SizeOfPredicates, 73 NumberOfNonLiveVariables, 855 ConjunctsInSsa, 357 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 1462/2393 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 18:23:28,620 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: TRUE