./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:07:48,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:07:48,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:07:48,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:07:48,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:07:48,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:07:48,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:07:48,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:07:48,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:07:48,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:07:48,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:07:48,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:07:48,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:07:48,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:07:48,612 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:07:48,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:07:48,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:07:48,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:07:48,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:07:48,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:07:48,613 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:07:48,614 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:07:48,614 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:07:48,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:07:48,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:07:48,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:07:48,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:07:48,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:07:48,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:07:48,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:07:48,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:07:48,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:07:48,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:07:48,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:48,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:07:48,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:07:48,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:07:48,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:07:48,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:07:48,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:07:48,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:07:48,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:07:48,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 [2024-11-09 08:07:48,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:07:48,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:07:48,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:07:48,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:07:48,889 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:07:48,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2024-11-09 08:07:50,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:07:50,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:07:50,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2024-11-09 08:07:50,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894328c58/1a427ccf3b454d119a1f5be118145036/FLAGed07182b9 [2024-11-09 08:07:50,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894328c58/1a427ccf3b454d119a1f5be118145036 [2024-11-09 08:07:50,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:07:50,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:07:50,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:50,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:07:50,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:07:50,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:50" (1/1) ... [2024-11-09 08:07:50,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b3ca12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:50, skipping insertion in model container [2024-11-09 08:07:50,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:07:50" (1/1) ... [2024-11-09 08:07:50,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:07:50,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:50,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:07:51,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:07:51,054 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:07:51,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51 WrapperNode [2024-11-09 08:07:51,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:07:51,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:51,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:07:51,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:07:51,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,112 INFO L138 Inliner]: procedures = 18, calls = 203, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 418 [2024-11-09 08:07:51,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:07:51,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:07:51,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:07:51,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:07:51,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,163 INFO L175 MemorySlicer]: Split 180 memory accesses to 5 slices as follows [2, 41, 7, 2, 128]. 71 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 0, 7, 2, 0]. The 127 writes are split as follows [0, 0, 0, 0, 127]. [2024-11-09 08:07:51,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:07:51,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:07:51,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:07:51,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:07:51,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (1/1) ... [2024-11-09 08:07:51,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:07:51,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:07:51,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:07:51,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:07:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 08:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 08:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:07:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 08:07:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 08:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 08:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 08:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 08:07:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:07:51,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 08:07:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:07:51,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:07:51,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:07:57,016 INFO L? ?]: Removed 234 outVars from TransFormulas that were not future-live. [2024-11-09 08:07:57,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:07:57,038 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:07:57,039 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 08:07:57,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57 BoogieIcfgContainer [2024-11-09 08:07:57,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:07:57,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:07:57,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:07:57,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:07:57,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:07:50" (1/3) ... [2024-11-09 08:07:57,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:57, skipping insertion in model container [2024-11-09 08:07:57,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:07:51" (2/3) ... [2024-11-09 08:07:57,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:57, skipping insertion in model container [2024-11-09 08:07:57,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:07:57" (3/3) ... [2024-11-09 08:07:57,050 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lh-reducer.c [2024-11-09 08:07:57,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:07:57,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2024-11-09 08:07:57,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:07:57,127 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;@3ecbfaae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:07:57,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2024-11-09 08:07:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 182 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:07:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:07:57,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:07:57,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:07:57,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:07:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:07:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash 925805, now seen corresponding path program 1 times [2024-11-09 08:07:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:07:57,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763665681] [2024-11-09 08:07:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:07:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:07:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:07:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:07:57,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:07:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763665681] [2024-11-09 08:07:57,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763665681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:07:57,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:07:57,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:07:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237820526] [2024-11-09 08:07:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:07:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:07:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:07:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:07:57,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:07:57,705 INFO L87 Difference]: Start difference. First operand has 183 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 182 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:03,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:07,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:11,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:12,462 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2024-11-09 08:08:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:08:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:08:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:12,473 INFO L225 Difference]: With dead ends: 183 [2024-11-09 08:08:12,473 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 08:08:12,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:08:12,478 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 164 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:12,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 200 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2024-11-09 08:08:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 08:08:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-09 08:08:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 94 states have (on average 1.9361702127659575) internal successors, (182), 179 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2024-11-09 08:08:12,530 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 4 [2024-11-09 08:08:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:12,530 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2024-11-09 08:08:12,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2024-11-09 08:08:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:08:12,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:12,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:08:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:08:12,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:08:12,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-09 08:08:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744929047] [2024-11-09 08:08:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744929047] [2024-11-09 08:08:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744929047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:13,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:13,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117284197] [2024-11-09 08:08:13,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:13,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:08:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:08:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:08:13,132 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:18,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:23,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:23,689 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2024-11-09 08:08:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:08:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:08:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:23,691 INFO L225 Difference]: With dead ends: 139 [2024-11-09 08:08:23,691 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 08:08:23,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:08:23,692 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 214 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:23,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 61 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-11-09 08:08:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 08:08:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 08:08:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.5) internal successors, (141), 138 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2024-11-09 08:08:23,702 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 4 [2024-11-09 08:08:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:23,703 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2024-11-09 08:08:23,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2024-11-09 08:08:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:08:23,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:23,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:08:23,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:08:23,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:08:23,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-09 08:08:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854196426] [2024-11-09 08:08:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854196426] [2024-11-09 08:08:24,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854196426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:24,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:24,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280069443] [2024-11-09 08:08:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:24,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:08:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:08:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:08:24,494 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:29,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:33,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:34,426 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2024-11-09 08:08:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:08:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:08:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:34,427 INFO L225 Difference]: With dead ends: 98 [2024-11-09 08:08:34,427 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 08:08:34,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:08:34,430 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:34,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 121 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2024-11-09 08:08:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 08:08:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 08:08:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2024-11-09 08:08:34,443 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 4 [2024-11-09 08:08:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:34,444 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-09 08:08:34,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2024-11-09 08:08:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 08:08:34,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:34,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:34,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:08:34,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:08:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1289678943, now seen corresponding path program 1 times [2024-11-09 08:08:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:34,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892438084] [2024-11-09 08:08:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:40,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892438084] [2024-11-09 08:08:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892438084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:40,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:08:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288152969] [2024-11-09 08:08:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:40,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:08:40,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:40,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:08:40,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:08:40,265 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:40,524 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2024-11-09 08:08:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:08:40,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-09 08:08:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:40,526 INFO L225 Difference]: With dead ends: 109 [2024-11-09 08:08:40,526 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 08:08:40,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:08:40,528 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 103 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:40,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 203 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:08:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 08:08:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-11-09 08:08:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 100 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2024-11-09 08:08:40,534 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 90 [2024-11-09 08:08:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:40,534 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2024-11-09 08:08:40,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2024-11-09 08:08:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 08:08:40,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:40,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:40,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:08:40,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:08:40,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1289693814, now seen corresponding path program 1 times [2024-11-09 08:08:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859953877] [2024-11-09 08:08:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859953877] [2024-11-09 08:08:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859953877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:45,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:45,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197277480] [2024-11-09 08:08:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:45,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:08:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:45,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:08:45,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:45,475 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:45,520 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2024-11-09 08:08:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:08:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-09 08:08:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:45,522 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:08:45,522 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:08:45,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:08:45,523 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:45,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:08:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:08:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 08:08:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2024-11-09 08:08:45,532 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 90 [2024-11-09 08:08:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:45,533 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2024-11-09 08:08:45,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2024-11-09 08:08:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 08:08:45,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:45,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:08:45,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:08:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1289693773, now seen corresponding path program 1 times [2024-11-09 08:08:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916100335] [2024-11-09 08:08:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:08:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:08:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:08:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:08:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916100335] [2024-11-09 08:08:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916100335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:08:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:08:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:08:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903746046] [2024-11-09 08:08:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:08:50,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:08:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:08:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:08:50,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:08:50,512 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:55,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:08:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:08:56,352 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2024-11-09 08:08:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:08:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-09 08:08:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:08:56,353 INFO L225 Difference]: With dead ends: 100 [2024-11-09 08:08:56,353 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 08:08:56,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:08:56,354 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 7 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:08:56,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-09 08:08:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 08:08:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 08:08:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.041237113402062) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2024-11-09 08:08:56,360 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 90 [2024-11-09 08:08:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:08:56,361 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2024-11-09 08:08:56,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:08:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2024-11-09 08:08:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 08:08:56,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:08:56,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:08:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 08:08:56,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:08:56,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:08:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1289693772, now seen corresponding path program 1 times [2024-11-09 08:08:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:08:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289809906] [2024-11-09 08:08:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:08:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:09:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:09:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:09:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:09:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289809906] [2024-11-09 08:09:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289809906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:09:02,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:09:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:09:02,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784169369] [2024-11-09 08:09:02,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:09:02,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:09:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:09:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:09:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:09:02,076 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:09:07,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:09:12,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 08:09:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:09:12,947 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2024-11-09 08:09:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:09:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-09 08:09:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:09:12,949 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:09:12,949 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:09:12,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:09:12,950 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:09:12,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-11-09 08:09:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:09:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 08:09:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:09:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2024-11-09 08:09:12,955 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 90 [2024-11-09 08:09:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:09:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-09 08:09:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:09:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2024-11-09 08:09:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 08:09:12,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:09:12,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:09:12,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:09:12,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-11-09 08:09:12,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:09:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1849837889, now seen corresponding path program 1 times [2024-11-09 08:09:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:09:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252591927] [2024-11-09 08:09:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:09:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:09:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat