./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 12:51:41,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:51:41,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:51:41,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:51:41,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:51:41,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:51:41,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:51:41,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:51:41,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:51:41,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:51:41,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:51:41,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:51:41,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:51:41,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:51:41,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:51:41,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:51:41,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:51:41,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:51:41,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:51:41,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:51:41,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:51:41,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:51:41,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:51:41,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:51:41,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:51:41,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:51:41,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:51:41,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:51:41,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:51:41,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:51:41,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:51:41,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:51:41,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:51:41,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:51:41,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:51:41,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:51:41,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:51:41,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:51:41,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:51:41,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:51:41,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:51:41,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 12:51:42,019 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:51:42,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:51:42,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:51:42,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:51:42,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:51:42,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:51:42,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:51:42,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:51:42,031 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:51:42,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:51:42,031 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:51:42,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 12:51:42,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:51:42,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 12:51:42,032 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:51:42,033 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:51:42,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:51:42,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:51:42,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:51:42,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:51:42,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:51:42,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:51:42,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:51:42,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:51:42,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:51:42,034 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:51:42,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:51:42,034 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:51:42,034 INFO L138 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.graphml 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 -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2023-02-15 12:51:42,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:51:42,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:51:42,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:51:42,231 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:51:42,231 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:51:42,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 12:51:43,142 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:51:43,326 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:51:43,326 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 12:51:43,333 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1bc188a/840bf71878924b319c1c1e2287d41a65/FLAG954548386 [2023-02-15 12:51:43,342 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1bc188a/840bf71878924b319c1c1e2287d41a65 [2023-02-15 12:51:43,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:51:43,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:51:43,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:51:43,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:51:43,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:51:43,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d52b1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43, skipping insertion in model container [2023-02-15 12:51:43,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:51:43,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:51:43,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:51:43,584 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:51:43,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:51:43,647 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:51:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43 WrapperNode [2023-02-15 12:51:43,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:51:43,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:51:43,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:51:43,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:51:43,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,673 INFO L138 Inliner]: procedures = 125, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2023-02-15 12:51:43,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:51:43,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:51:43,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:51:43,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:51:43,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:51:43,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:51:43,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:51:43,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:51:43,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (1/1) ... [2023-02-15 12:51:43,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:51:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:51:43,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 12:51:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 12:51:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 12:51:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:51:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 12:51:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 12:51:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 12:51:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 12:51:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:51:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:51:43,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:51:43,845 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:51:43,846 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:51:44,037 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:51:44,041 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:51:44,041 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 12:51:44,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:51:44 BoogieIcfgContainer [2023-02-15 12:51:44,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:51:44,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:51:44,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:51:44,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:51:44,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:51:43" (1/3) ... [2023-02-15 12:51:44,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edf707b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:51:44, skipping insertion in model container [2023-02-15 12:51:44,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:43" (2/3) ... [2023-02-15 12:51:44,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edf707b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:51:44, skipping insertion in model container [2023-02-15 12:51:44,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:51:44" (3/3) ... [2023-02-15 12:51:44,048 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2023-02-15 12:51:44,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:51:44,060 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-02-15 12:51:44,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:51:44,102 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4c4fef22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:51:44,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-02-15 12:51:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 12:51:44,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:44,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 12:51:44,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 12:51:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:44,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108813525] [2023-02-15 12:51:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:44,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108813525] [2023-02-15 12:51:44,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108813525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:44,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:44,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:51:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225690077] [2023-02-15 12:51:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:44,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:51:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:51:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:44,329 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:44,370 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2023-02-15 12:51:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:51:44,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-02-15 12:51:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:44,377 INFO L225 Difference]: With dead ends: 48 [2023-02-15 12:51:44,377 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 12:51:44,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:44,381 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:44,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 12:51:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-02-15 12:51:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2023-02-15 12:51:44,402 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2023-02-15 12:51:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:44,402 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2023-02-15 12:51:44,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2023-02-15 12:51:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 12:51:44,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:44,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 12:51:44,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:51:44,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 12:51:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712056501] [2023-02-15 12:51:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:44,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712056501] [2023-02-15 12:51:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712056501] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:44,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:51:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623979116] [2023-02-15 12:51:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:44,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:51:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:51:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:44,506 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:44,523 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2023-02-15 12:51:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:51:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-02-15 12:51:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:44,524 INFO L225 Difference]: With dead ends: 38 [2023-02-15 12:51:44,525 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 12:51:44,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:44,526 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:44,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 12:51:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 12:51:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2023-02-15 12:51:44,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2023-02-15 12:51:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:44,530 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2023-02-15 12:51:44,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2023-02-15 12:51:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 12:51:44,530 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:44,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 12:51:44,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:51:44,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2023-02-15 12:51:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:44,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886375735] [2023-02-15 12:51:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:44,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:44,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886375735] [2023-02-15 12:51:44,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886375735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:44,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:44,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:51:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128740677] [2023-02-15 12:51:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:44,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:51:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:51:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:51:44,701 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:44,771 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2023-02-15 12:51:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 12:51:44,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 12:51:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:44,773 INFO L225 Difference]: With dead ends: 44 [2023-02-15 12:51:44,773 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 12:51:44,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:51:44,775 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:44,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:51:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 12:51:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-15 12:51:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-02-15 12:51:44,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2023-02-15 12:51:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:44,781 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-02-15 12:51:44,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-02-15 12:51:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 12:51:44,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:44,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:44,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 12:51:44,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2023-02-15 12:51:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:44,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586993601] [2023-02-15 12:51:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:44,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586993601] [2023-02-15 12:51:44,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586993601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:44,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:44,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:51:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825430090] [2023-02-15 12:51:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:44,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:51:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:51:44,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:51:44,876 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:44,939 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2023-02-15 12:51:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 12:51:44,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 12:51:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:44,940 INFO L225 Difference]: With dead ends: 39 [2023-02-15 12:51:44,941 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 12:51:44,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:51:44,948 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:44,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 12:51:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 12:51:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-02-15 12:51:44,956 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2023-02-15 12:51:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:44,957 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-02-15 12:51:44,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-02-15 12:51:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 12:51:44,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:44,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:44,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 12:51:44,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2023-02-15 12:51:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:44,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703946188] [2023-02-15 12:51:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:45,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703946188] [2023-02-15 12:51:45,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703946188] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:45,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:45,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:51:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381401308] [2023-02-15 12:51:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:45,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:51:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:51:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:51:45,116 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:45,157 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2023-02-15 12:51:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:51:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 12:51:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:45,159 INFO L225 Difference]: With dead ends: 31 [2023-02-15 12:51:45,159 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 12:51:45,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 12:51:45,162 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:45,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 12:51:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-15 12:51:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2023-02-15 12:51:45,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2023-02-15 12:51:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:45,171 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2023-02-15 12:51:45,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2023-02-15 12:51:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 12:51:45,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:45,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:45,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 12:51:45,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2023-02-15 12:51:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:45,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376383652] [2023-02-15 12:51:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:45,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376383652] [2023-02-15 12:51:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376383652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:45,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:45,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:51:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499384027] [2023-02-15 12:51:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:45,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:51:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:51:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:51:45,302 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:45,376 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2023-02-15 12:51:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:51:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 12:51:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:45,377 INFO L225 Difference]: With dead ends: 30 [2023-02-15 12:51:45,377 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 12:51:45,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 12:51:45,378 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 77 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:45,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 56 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 12:51:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 12:51:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2023-02-15 12:51:45,380 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2023-02-15 12:51:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:45,380 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2023-02-15 12:51:45,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2023-02-15 12:51:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 12:51:45,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:45,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:45,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 12:51:45,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2023-02-15 12:51:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:45,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959530543] [2023-02-15 12:51:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:45,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:45,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959530543] [2023-02-15 12:51:45,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959530543] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:45,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:45,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:51:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869369331] [2023-02-15 12:51:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:45,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:51:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:51:45,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:51:45,566 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:45,657 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2023-02-15 12:51:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:51:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-15 12:51:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:45,661 INFO L225 Difference]: With dead ends: 29 [2023-02-15 12:51:45,661 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 12:51:45,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 12:51:45,662 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:45,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 37 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 12:51:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 12:51:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-02-15 12:51:45,668 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2023-02-15 12:51:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:45,668 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-02-15 12:51:45,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-02-15 12:51:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 12:51:45,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:45,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:45,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 12:51:45,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2023-02-15 12:51:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:45,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405251325] [2023-02-15 12:51:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:51:45,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405251325] [2023-02-15 12:51:45,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405251325] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:45,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:45,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:51:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555242455] [2023-02-15 12:51:45,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:45,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:51:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:51:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:51:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:51:45,869 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:45,955 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2023-02-15 12:51:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:51:45,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-02-15 12:51:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:45,956 INFO L225 Difference]: With dead ends: 30 [2023-02-15 12:51:45,956 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 12:51:45,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 12:51:45,958 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:45,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 45 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 12:51:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-02-15 12:51:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2023-02-15 12:51:45,970 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2023-02-15 12:51:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:45,971 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2023-02-15 12:51:45,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2023-02-15 12:51:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 12:51:45,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:45,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:45,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 12:51:45,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:45,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2023-02-15 12:51:45,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:51:45,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928700638] [2023-02-15 12:51:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:51:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:51:46,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 12:51:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:51:46,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 12:51:46,037 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 12:51:46,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2023-02-15 12:51:46,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2023-02-15 12:51:46,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2023-02-15 12:51:46,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2023-02-15 12:51:46,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2023-02-15 12:51:46,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2023-02-15 12:51:46,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2023-02-15 12:51:46,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2023-02-15 12:51:46,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2023-02-15 12:51:46,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2023-02-15 12:51:46,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2023-02-15 12:51:46,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2023-02-15 12:51:46,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 12:51:46,043 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:46,046 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 12:51:46,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:51:46 BoogieIcfgContainer [2023-02-15 12:51:46,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 12:51:46,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 12:51:46,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 12:51:46,074 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 12:51:46,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:51:44" (3/4) ... [2023-02-15 12:51:46,077 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 12:51:46,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 12:51:46,078 INFO L158 Benchmark]: Toolchain (without parser) took 2733.88ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 121.5MB in the beginning and 93.6MB in the end (delta: 28.0MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2023-02-15 12:51:46,078 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:51:46,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.28ms. Allocated memory is still 153.1MB. Free memory was 121.5MB in the beginning and 118.0MB in the end (delta: 3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 12:51:46,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.77ms. Allocated memory is still 153.1MB. Free memory was 118.0MB in the beginning and 115.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:51:46,080 INFO L158 Benchmark]: Boogie Preprocessor took 14.28ms. Allocated memory is still 153.1MB. Free memory was 115.2MB in the beginning and 113.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:51:46,080 INFO L158 Benchmark]: RCFGBuilder took 353.96ms. Allocated memory is still 153.1MB. Free memory was 113.8MB in the beginning and 100.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 12:51:46,080 INFO L158 Benchmark]: TraceAbstraction took 2029.35ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 99.8MB in the beginning and 94.6MB in the end (delta: 5.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-02-15 12:51:46,080 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 184.5MB. Free memory was 94.6MB in the beginning and 93.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:51:46,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.28ms. Allocated memory is still 153.1MB. Free memory was 121.5MB in the beginning and 118.0MB in the end (delta: 3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.77ms. Allocated memory is still 153.1MB. Free memory was 118.0MB in the beginning and 115.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.28ms. Allocated memory is still 153.1MB. Free memory was 115.2MB in the beginning and 113.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.96ms. Allocated memory is still 153.1MB. Free memory was 113.8MB in the beginning and 100.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2029.35ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 99.8MB in the beginning and 94.6MB in the end (delta: 5.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 184.5MB. Free memory was 94.6MB in the beginning and 93.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={3:0}, pdata={3:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={-2:0}, pdata={3:0}, pdata={3:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={3:0}, data={3:0}, data->lo={-1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={3:0}, data={3:0}, data->hi={-2:0}, lo={-1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L540] data->lo = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L541] data->hi = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 347 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 160 mSDtfsCounter, 347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 12:51:46,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 12:51:47,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:51:47,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:51:47,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:51:47,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:51:47,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:51:47,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:51:47,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:51:47,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:51:47,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:51:47,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:51:47,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:51:47,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:51:47,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:51:47,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:51:47,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:51:47,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:51:47,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:51:47,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:51:47,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:51:48,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:51:48,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:51:48,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:51:48,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:51:48,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:51:48,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:51:48,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:51:48,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:51:48,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:51:48,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:51:48,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:51:48,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:51:48,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:51:48,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:51:48,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:51:48,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:51:48,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:51:48,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:51:48,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:51:48,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:51:48,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:51:48,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 12:51:48,044 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:51:48,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:51:48,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:51:48,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:51:48,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:51:48,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:51:48,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:51:48,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:51:48,047 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:51:48,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:51:48,048 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:51:48,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 12:51:48,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:51:48,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:51:48,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:51:48,049 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 12:51:48,049 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 12:51:48,049 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 12:51:48,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:51:48,050 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 12:51:48,050 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 12:51:48,054 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 12:51:48,054 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:51:48,054 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:51:48,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:51:48,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:51:48,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:51:48,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:51:48,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:51:48,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:51:48,055 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 12:51:48,055 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 12:51:48,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:51:48,055 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:51:48,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:51:48,056 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 12:51:48,056 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:51:48,056 INFO L138 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.graphml 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 -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2023-02-15 12:51:48,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:51:48,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:51:48,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:51:48,369 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:51:48,369 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:51:48,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 12:51:49,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:51:49,576 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:51:49,580 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 12:51:49,590 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b228f8/76694111782740928fb77395e7366ff9/FLAG6ef9a7b3c [2023-02-15 12:51:49,601 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b228f8/76694111782740928fb77395e7366ff9 [2023-02-15 12:51:49,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:51:49,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:51:49,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:51:49,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:51:49,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:51:49,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1cd132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49, skipping insertion in model container [2023-02-15 12:51:49,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:51:49,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:51:49,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:51:49,833 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:51:49,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:51:49,877 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:51:49,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49 WrapperNode [2023-02-15 12:51:49,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:51:49,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:51:49,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:51:49,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:51:49,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,905 INFO L138 Inliner]: procedures = 126, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2023-02-15 12:51:49,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:51:49,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:51:49,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:51:49,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:51:49,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,922 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:51:49,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:51:49,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:51:49,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:51:49,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (1/1) ... [2023-02-15 12:51:49,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:51:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:51:49,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 12:51:49,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 12:51:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 12:51:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:51:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 12:51:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 12:51:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 12:51:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 12:51:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 12:51:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:51:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:51:50,074 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:51:50,076 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:51:50,362 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:51:50,366 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:51:50,372 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 12:51:50,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:51:50 BoogieIcfgContainer [2023-02-15 12:51:50,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:51:50,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:51:50,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:51:50,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:51:50,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:51:49" (1/3) ... [2023-02-15 12:51:50,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cfc1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:51:50, skipping insertion in model container [2023-02-15 12:51:50,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:51:49" (2/3) ... [2023-02-15 12:51:50,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cfc1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:51:50, skipping insertion in model container [2023-02-15 12:51:50,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:51:50" (3/3) ... [2023-02-15 12:51:50,380 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2023-02-15 12:51:50,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:51:50,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-02-15 12:51:50,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:51:50,438 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1cedf0bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:51:50,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-02-15 12:51:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 12:51:50,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:50,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 12:51:50,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 12:51:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:50,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066571348] [2023-02-15 12:51:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:50,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:50,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:50,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 12:51:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:50,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 12:51:50,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:50,624 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 12:51:50,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 12:51:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:50,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:50,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:50,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066571348] [2023-02-15 12:51:50,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066571348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:50,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:50,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:51:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828094569] [2023-02-15 12:51:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:50,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:51:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:51:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:50,664 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:50,728 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2023-02-15 12:51:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:51:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-02-15 12:51:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:50,735 INFO L225 Difference]: With dead ends: 48 [2023-02-15 12:51:50,735 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 12:51:50,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:50,738 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:50,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:51:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 12:51:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-02-15 12:51:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2023-02-15 12:51:50,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2023-02-15 12:51:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:50,759 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2023-02-15 12:51:50,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2023-02-15 12:51:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 12:51:50,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:50,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 12:51:50,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:50,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:50,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 12:51:50,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:50,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785323333] [2023-02-15 12:51:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:50,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:50,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:50,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:50,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 12:51:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:51,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 12:51:51,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:51,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:51:51,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-15 12:51:51,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-02-15 12:51:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:51,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:51,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:51,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785323333] [2023-02-15 12:51:51,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785323333] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:51,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:51,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:51:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136979007] [2023-02-15 12:51:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:51:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:51:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:51,086 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:51,141 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2023-02-15 12:51:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:51:51,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-02-15 12:51:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:51,142 INFO L225 Difference]: With dead ends: 38 [2023-02-15 12:51:51,143 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 12:51:51,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:51:51,144 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:51,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 12:51:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 12:51:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2023-02-15 12:51:51,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2023-02-15 12:51:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:51,150 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2023-02-15 12:51:51,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2023-02-15 12:51:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 12:51:51,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:51,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 12:51:51,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:51,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:51,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2023-02-15 12:51:51,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:51,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668903426] [2023-02-15 12:51:51,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:51,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:51,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:51,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:51,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 12:51:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:51,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 12:51:51,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:51,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:51:51,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-15 12:51:51,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-02-15 12:51:51,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:51:51,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 12:51:51,530 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 12:51:51,530 INFO L350 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 13 treesize of output 13 [2023-02-15 12:51:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:51,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:51,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:51,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668903426] [2023-02-15 12:51:51,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668903426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:51,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:51,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:51:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197751496] [2023-02-15 12:51:51,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:51,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:51:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:51,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:51:51,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:51:51,534 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:51,610 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2023-02-15 12:51:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 12:51:51,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 12:51:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:51,611 INFO L225 Difference]: With dead ends: 44 [2023-02-15 12:51:51,612 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 12:51:51,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:51:51,612 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:51,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:51:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 12:51:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-15 12:51:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-02-15 12:51:51,616 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2023-02-15 12:51:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:51,616 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-02-15 12:51:51,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-02-15 12:51:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 12:51:51,617 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:51,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:51,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-02-15 12:51:51,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:51,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2023-02-15 12:51:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:51,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594393072] [2023-02-15 12:51:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:51,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:51,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:51,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:51,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 12:51:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:51,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 12:51:51,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:51,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:51,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:51,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594393072] [2023-02-15 12:51:51,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594393072] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:51,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:51,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:51:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915244543] [2023-02-15 12:51:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:51,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:51:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:51:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:51:51,987 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:52,095 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2023-02-15 12:51:52,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 12:51:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 12:51:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:52,097 INFO L225 Difference]: With dead ends: 39 [2023-02-15 12:51:52,097 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 12:51:52,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:51:52,097 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:52,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:51:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 12:51:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 12:51:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-02-15 12:51:52,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2023-02-15 12:51:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:52,100 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-02-15 12:51:52,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-02-15 12:51:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 12:51:52,101 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:52,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:52,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:52,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:52,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2023-02-15 12:51:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:52,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208655551] [2023-02-15 12:51:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:52,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:52,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:52,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:52,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 12:51:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:52,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 12:51:52,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:52,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:52,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:52,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208655551] [2023-02-15 12:51:52,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208655551] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:52,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:52,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:51:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440691443] [2023-02-15 12:51:52,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:52,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:51:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:52,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:51:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:51:52,412 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:52,486 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2023-02-15 12:51:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:51:52,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 12:51:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:52,487 INFO L225 Difference]: With dead ends: 31 [2023-02-15 12:51:52,487 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 12:51:52,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 12:51:52,494 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:52,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:51:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 12:51:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-15 12:51:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2023-02-15 12:51:52,496 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2023-02-15 12:51:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:52,496 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2023-02-15 12:51:52,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2023-02-15 12:51:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 12:51:52,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:52,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:52,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-15 12:51:52,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:52,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2023-02-15 12:51:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:52,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167170463] [2023-02-15 12:51:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:52,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:52,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:52,707 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:52,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 12:51:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:52,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 12:51:52,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:52,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 12:51:52,821 INFO L350 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 19 treesize of output 7 [2023-02-15 12:51:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:52,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:52,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167170463] [2023-02-15 12:51:52,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167170463] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:52,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:52,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:51:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123892104] [2023-02-15 12:51:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:52,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 12:51:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 12:51:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:51:52,851 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:53,118 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2023-02-15 12:51:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 12:51:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 12:51:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:53,119 INFO L225 Difference]: With dead ends: 33 [2023-02-15 12:51:53,119 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 12:51:53,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-02-15 12:51:53,120 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:53,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 63 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:51:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 12:51:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-02-15 12:51:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-02-15 12:51:53,123 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2023-02-15 12:51:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:53,123 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-02-15 12:51:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-02-15 12:51:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 12:51:53,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:53,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:53,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:53,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:53,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2023-02-15 12:51:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:53,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686108536] [2023-02-15 12:51:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:53,334 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:53,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 12:51:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:53,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 12:51:53,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:53,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 12:51:53,549 INFO L350 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 19 treesize of output 7 [2023-02-15 12:51:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:53,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:53,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:53,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686108536] [2023-02-15 12:51:53,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686108536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:53,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:53,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:51:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709176102] [2023-02-15 12:51:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:53,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 12:51:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 12:51:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 12:51:53,683 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:54,513 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2023-02-15 12:51:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 12:51:54,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-15 12:51:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:54,514 INFO L225 Difference]: With dead ends: 31 [2023-02-15 12:51:54,514 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 12:51:54,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-02-15 12:51:54,515 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:54,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 25 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 12:51:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 12:51:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-15 12:51:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2023-02-15 12:51:54,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2023-02-15 12:51:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:54,517 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2023-02-15 12:51:54,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2023-02-15 12:51:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 12:51:54,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:54,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:54,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:54,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:54,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2023-02-15 12:51:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:54,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296742410] [2023-02-15 12:51:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:54,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:54,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:54,723 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:54,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 12:51:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:51:54,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 12:51:54,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:51:54,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 12:51:54,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 12:51:54,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 12:51:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:51:54,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:51:54,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 12:51:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296742410] [2023-02-15 12:51:54,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296742410] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:51:54,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:51:54,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:51:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195336832] [2023-02-15 12:51:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:51:54,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 12:51:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 12:51:54,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 12:51:54,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:51:54,969 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:51:55,513 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2023-02-15 12:51:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 12:51:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-02-15 12:51:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:51:55,515 INFO L225 Difference]: With dead ends: 28 [2023-02-15 12:51:55,515 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 12:51:55,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-15 12:51:55,516 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:51:55,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 34 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 12:51:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 12:51:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-15 12:51:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-02-15 12:51:55,518 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 15 [2023-02-15 12:51:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:51:55,518 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-02-15 12:51:55,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:51:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-02-15 12:51:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 12:51:55,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:51:55,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:55,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:55,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:55,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 12:51:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:51:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2023-02-15 12:51:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 12:51:55,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10844958] [2023-02-15 12:51:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:51:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 12:51:55,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 12:51:55,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 12:51:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:51:55,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 12:51:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:51:55,862 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 12:51:55,863 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 12:51:55,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2023-02-15 12:51:55,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2023-02-15 12:51:55,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2023-02-15 12:51:55,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2023-02-15 12:51:55,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2023-02-15 12:51:55,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 12:51:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 12:51:56,070 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:51:56,072 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 12:51:56,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:51:56 BoogieIcfgContainer [2023-02-15 12:51:56,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 12:51:56,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 12:51:56,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 12:51:56,094 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 12:51:56,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:51:50" (3/4) ... [2023-02-15 12:51:56,096 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 12:51:56,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 12:51:56,097 INFO L158 Benchmark]: Toolchain (without parser) took 6492.88ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 89.3MB in the beginning and 68.9MB in the end (delta: 20.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2023-02-15 12:51:56,097 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 67.1MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:51:56,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.10ms. Allocated memory is still 113.2MB. Free memory was 89.3MB in the beginning and 72.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 12:51:56,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 113.2MB. Free memory was 72.2MB in the beginning and 70.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:51:56,097 INFO L158 Benchmark]: Boogie Preprocessor took 17.69ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 68.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:51:56,098 INFO L158 Benchmark]: RCFGBuilder took 449.74ms. Allocated memory is still 113.2MB. Free memory was 68.6MB in the beginning and 87.6MB in the end (delta: -19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 12:51:56,098 INFO L158 Benchmark]: TraceAbstraction took 5717.66ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 87.1MB in the beginning and 68.9MB in the end (delta: 18.2MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2023-02-15 12:51:56,098 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 151.0MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:51:56,100 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 67.1MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.10ms. Allocated memory is still 113.2MB. Free memory was 89.3MB in the beginning and 72.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 113.2MB. Free memory was 72.2MB in the beginning and 70.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.69ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 68.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.74ms. Allocated memory is still 113.2MB. Free memory was 68.6MB in the beginning and 87.6MB in the end (delta: -19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5717.66ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 87.1MB in the beginning and 68.9MB in the end (delta: 18.2MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 151.0MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={3:0}, pdata={11:0}, pdata={11:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={4:0}, pdata={11:0}, pdata={11:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={11:0}, data={11:0}, data->lo={3:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={11:0}, data={11:0}, data->hi={4:0}, lo={3:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L540] data->lo = (void *) 0 VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L541] data->hi = (void *) 0 VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 153 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 12 QuantifiedInterpolants, 555 SizeOfPredicates, 66 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 12:51:56,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample