./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/list-properties/simple_built_from_end.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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:21:14,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:21:14,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:21:14,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:21:14,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:21:14,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:21:14,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:21:14,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:21:14,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:21:14,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:21:14,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:21:14,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:21:14,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:21:14,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:21:14,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:21:14,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:21:14,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:21:14,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:21:14,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:21:14,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:21:14,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:21:14,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:21:14,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:21:14,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:21:14,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:21:14,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:21:14,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:21:14,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:21:14,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:21:14,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:21:14,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:21:14,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:21:14,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:21:14,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:21:14,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:21:14,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:21:14,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:21:14,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:21:14,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:21:14,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:21:14,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:21:14,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:21:14,930 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:21:14,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:21:14,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:21:14,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:21:14,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:21:14,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:21:14,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:21:14,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:21:14,933 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:21:14,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:21:14,934 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:21:14,935 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:21:14,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:21:14,935 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:21:14,935 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:21:14,935 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:21:14,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:21:14,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:21:14,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:21:14,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:14,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:21:14,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:21:14,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:21:14,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:21:14,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:21:14,937 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:21:14,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:21:14,937 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:21:14,938 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2023-02-15 22:21:15,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:21:15,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:21:15,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:21:15,142 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:21:15,142 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:21:15,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-15 22:21:16,147 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:21:16,342 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:21:16,342 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-15 22:21:16,353 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbca2cf82/8e3593071cbc4dea8daff6b955daa3d7/FLAG4226b24b8 [2023-02-15 22:21:16,367 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbca2cf82/8e3593071cbc4dea8daff6b955daa3d7 [2023-02-15 22:21:16,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:21:16,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:21:16,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:16,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:21:16,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:21:16,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d15d570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16, skipping insertion in model container [2023-02-15 22:21:16,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:21:16,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:21:16,629 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-15 22:21:16,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:16,639 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:21:16,671 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-15 22:21:16,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:16,700 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:21:16,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16 WrapperNode [2023-02-15 22:21:16,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:16,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:16,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:21:16,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:21:16,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,735 INFO L138 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-02-15 22:21:16,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:16,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:21:16,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:21:16,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:21:16,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:21:16,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:21:16,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:21:16,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:21:16,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (1/1) ... [2023-02-15 22:21:16,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:16,795 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 22:21:16,796 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 22:21:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:21:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:21:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:21:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:21:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:21:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:21:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:21:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:21:16,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:21:16,880 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:21:16,881 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:21:16,993 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:21:16,997 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:21:16,998 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:21:16,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:16 BoogieIcfgContainer [2023-02-15 22:21:16,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:21:17,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:21:17,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:21:17,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:21:17,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:21:16" (1/3) ... [2023-02-15 22:21:17,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15907545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:17, skipping insertion in model container [2023-02-15 22:21:17,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:16" (2/3) ... [2023-02-15 22:21:17,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15907545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:17, skipping insertion in model container [2023-02-15 22:21:17,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:16" (3/3) ... [2023-02-15 22:21:17,005 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-02-15 22:21:17,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:21:17,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-02-15 22:21:17,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:21:17,123 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;@77ae34f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:21:17,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-02-15 22:21:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 states have internal predecessors, (33), 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 22:21:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:21:17,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:21:17,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 28716783, now seen corresponding path program 1 times [2023-02-15 22:21:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023889374] [2023-02-15 22:21:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,274 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 22:21:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023889374] [2023-02-15 22:21:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023889374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904359498] [2023-02-15 22:21:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:21:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:21:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:21:17,312 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 22:21:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,322 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-15 22:21:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:21:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 22:21:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,330 INFO L225 Difference]: With dead ends: 28 [2023-02-15 22:21:17,330 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 22:21:17,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:21:17,335 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 22:21:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-15 22:21:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 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 22:21:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-15 22:21:17,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2023-02-15 22:21:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,359 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-15 22:21:17,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 22:21:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-15 22:21:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:17,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:21:17,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 889570012, now seen corresponding path program 1 times [2023-02-15 22:21:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540349857] [2023-02-15 22:21:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,420 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 22:21:17,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540349857] [2023-02-15 22:21:17,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540349857] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245816791] [2023-02-15 22:21:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:17,423 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,452 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-02-15 22:21:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:21:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,453 INFO L225 Difference]: With dead ends: 39 [2023-02-15 22:21:17,453 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 22:21:17,453 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 22:21:17,454 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 22:21:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-15 22:21:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 31 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 22:21:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-15 22:21:17,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2023-02-15 22:21:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,459 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-15 22:21:17,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-15 22:21:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:17,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:21:17,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 889570056, now seen corresponding path program 1 times [2023-02-15 22:21:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361482082] [2023-02-15 22:21:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,507 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 22:21:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361482082] [2023-02-15 22:21:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361482082] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283263737] [2023-02-15 22:21:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:17,512 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,542 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-02-15 22:21:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:17,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:21:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,543 INFO L225 Difference]: With dead ends: 36 [2023-02-15 22:21:17,543 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 22:21:17,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:21:17,544 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 22:21:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-02-15 22:21:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 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 22:21:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-02-15 22:21:17,550 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2023-02-15 22:21:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,551 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-02-15 22:21:17,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-02-15 22:21:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:17,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:21:17,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2023-02-15 22:21:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828357037] [2023-02-15 22:21:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,628 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 22:21:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828357037] [2023-02-15 22:21:17,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828357037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475074945] [2023-02-15 22:21:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:17,632 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,662 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-02-15 22:21:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:21:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,663 INFO L225 Difference]: With dead ends: 25 [2023-02-15 22:21:17,664 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 22:21:17,664 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 22:21:17,668 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 22:21:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-15 22:21:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 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 22:21:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-15 22:21:17,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 6 [2023-02-15 22:21:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,676 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-15 22:21:17,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-15 22:21:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:17,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:21:17,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash 889571372, now seen corresponding path program 1 times [2023-02-15 22:21:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591399181] [2023-02-15 22:21:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,766 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 22:21:17,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591399181] [2023-02-15 22:21:17,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591399181] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:17,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045634655] [2023-02-15 22:21:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:17,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:17,770 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,797 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-02-15 22:21:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:21:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,799 INFO L225 Difference]: With dead ends: 23 [2023-02-15 22:21:17,800 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 22:21:17,800 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 22:21:17,803 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 22:21:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 22:21:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 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 22:21:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-02-15 22:21:17,806 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2023-02-15 22:21:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,806 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-02-15 22:21:17,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-02-15 22:21:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:21:17,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:21:17,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170662, now seen corresponding path program 1 times [2023-02-15 22:21:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141931970] [2023-02-15 22:21:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141931970] [2023-02-15 22:21:17,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141931970] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:21:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940425954] [2023-02-15 22:21:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:17,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:17,858 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22:21:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,897 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-02-15 22:21:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-15 22:21:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,898 INFO L225 Difference]: With dead ends: 38 [2023-02-15 22:21:17,898 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 22:21:17,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:17,900 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 22:21:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2023-02-15 22:21:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 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 22:21:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-02-15 22:21:17,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2023-02-15 22:21:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,903 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-02-15 22:21:17,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22:21:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-02-15 22:21:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:21:17,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,904 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:21:17,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170706, now seen corresponding path program 1 times [2023-02-15 22:21:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456158544] [2023-02-15 22:21:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:17,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:17,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456158544] [2023-02-15 22:21:17,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456158544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:17,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:17,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589689507] [2023-02-15 22:21:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:17,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:17,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:17,942 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22:21:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:17,971 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-02-15 22:21:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:17,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-15 22:21:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:17,972 INFO L225 Difference]: With dead ends: 29 [2023-02-15 22:21:17,972 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 22:21:17,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:17,973 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:17,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 22:21:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-02-15 22:21:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 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 22:21:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-02-15 22:21:17,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2023-02-15 22:21:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:17,975 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-02-15 22:21:17,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22:21:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-02-15 22:21:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:21:17,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:17,976 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:21:17,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170707, now seen corresponding path program 1 times [2023-02-15 22:21:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884139442] [2023-02-15 22:21:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:18,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:18,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884139442] [2023-02-15 22:21:18,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884139442] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:18,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:18,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151297314] [2023-02-15 22:21:18,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:18,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:18,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:18,050 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22:21:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:18,082 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-02-15 22:21:18,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:18,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-15 22:21:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:18,083 INFO L225 Difference]: With dead ends: 33 [2023-02-15 22:21:18,084 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 22:21:18,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:18,084 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:18,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 22:21:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-15 22:21:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 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 22:21:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-02-15 22:21:18,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2023-02-15 22:21:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:18,087 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-15 22:21:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 22:21:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-02-15 22:21:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:21:18,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:18,088 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:18,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:21:18,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash -349878285, now seen corresponding path program 1 times [2023-02-15 22:21:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:18,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747359042] [2023-02-15 22:21:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:18,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747359042] [2023-02-15 22:21:18,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747359042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:18,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:18,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453713256] [2023-02-15 22:21:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:18,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:21:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:21:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:18,169 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 22:21:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:18,218 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-02-15 22:21:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:21:18,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 22:21:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:18,219 INFO L225 Difference]: With dead ends: 30 [2023-02-15 22:21:18,219 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 22:21:18,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 22:21:18,219 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:18,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 22:21:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-02-15 22:21:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 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 22:21:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-15 22:21:18,222 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2023-02-15 22:21:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:18,222 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-15 22:21:18,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 22:21:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-15 22:21:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:21:18,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:18,223 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:18,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:21:18,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash 666457592, now seen corresponding path program 1 times [2023-02-15 22:21:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:18,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543543502] [2023-02-15 22:21:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:18,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:21:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:18,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:21:18,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:21:18,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-02-15 22:21:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-02-15 22:21:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-02-15 22:21:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-02-15 22:21:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-02-15 22:21:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-02-15 22:21:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2023-02-15 22:21:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2023-02-15 22:21:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-02-15 22:21:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2023-02-15 22:21:18,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:21:18,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:18,257 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:21:18,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:18 BoogieIcfgContainer [2023-02-15 22:21:18,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:21:18,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:21:18,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:21:18,276 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:21:18,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:16" (3/4) ... [2023-02-15 22:21:18,279 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:21:18,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:21:18,279 INFO L158 Benchmark]: Toolchain (without parser) took 1909.37ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 102.4MB in the beginning and 122.0MB in the end (delta: -19.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:18,280 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:18,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.87ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 85.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 22:21:18,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.09ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:18,280 INFO L158 Benchmark]: Boogie Preprocessor took 14.71ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:18,280 INFO L158 Benchmark]: RCFGBuilder took 248.11ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 70.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 22:21:18,281 INFO L158 Benchmark]: TraceAbstraction took 1275.38ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.1MB in the beginning and 123.1MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:18,281 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 182.5MB. Free memory was 123.1MB in the beginning and 122.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:18,282 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.14ms. Allocated memory is still 142.6MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.87ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 85.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.09ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.71ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.11ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 70.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1275.38ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.1MB in the beginning and 123.1MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 182.5MB. Free memory was 123.1MB in the beginning and 122.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={-1:0}] [L537] t->h = 1 VAL [p={0:0}, t={-1:0}] [L538] t->n = p VAL [p={0:0}, t={-1:0}] [L539] p = t VAL [p={-1:0}, t={-1:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={-1:0}, t={-1:0}] [L542] EXPR p->h VAL [p={-1:0}, p->h=1, t={-1:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={-1:0}, p->n={0:0}, t={-1:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={-1: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: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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, 28 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 160 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 32, 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, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 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 22:21:18,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/list-properties/simple_built_from_end.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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:21:19,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:21:19,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:21:19,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:21:19,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:21:20,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:21:20,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:21:20,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:21:20,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:21:20,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:21:20,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:21:20,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:21:20,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:21:20,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:21:20,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:21:20,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:21:20,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:21:20,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:21:20,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:21:20,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:21:20,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:21:20,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:21:20,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:21:20,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:21:20,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:21:20,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:21:20,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:21:20,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:21:20,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:21:20,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:21:20,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:21:20,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:21:20,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:21:20,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:21:20,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:21:20,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:21:20,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:21:20,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:21:20,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:21:20,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:21:20,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:21:20,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:21:20,075 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:21:20,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:21:20,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:21:20,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:21:20,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:21:20,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:21:20,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:21:20,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:21:20,078 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:21:20,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:21:20,079 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:21:20,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:21:20,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:21:20,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:21:20,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:21:20,080 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:21:20,080 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:21:20,080 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:21:20,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:21:20,081 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:21:20,081 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:21:20,081 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:21:20,081 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:21:20,081 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:21:20,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:21:20,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:21:20,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:21:20,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:20,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:21:20,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:21:20,083 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:21:20,083 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:21:20,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:21:20,083 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:21:20,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:21:20,084 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:21:20,084 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:21:20,084 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2023-02-15 22:21:20,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:21:20,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:21:20,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:21:20,348 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:21:20,348 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:21:20,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-15 22:21:21,367 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:21:21,588 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:21:21,588 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-15 22:21:21,603 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825bbf129/b1a72e2ea25d410a8246550d35e2cf00/FLAGe9a2e7b07 [2023-02-15 22:21:21,612 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825bbf129/b1a72e2ea25d410a8246550d35e2cf00 [2023-02-15 22:21:21,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:21:21,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:21:21,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:21,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:21:21,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:21:21,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dda3968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21, skipping insertion in model container [2023-02-15 22:21:21,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:21:21,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:21:21,858 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-15 22:21:21,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:21,873 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:21:21,904 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-15 22:21:21,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:21,926 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:21:21,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21 WrapperNode [2023-02-15 22:21:21,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:21,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:21,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:21:21,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:21:21,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,976 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-02-15 22:21:21,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:21,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:21:21,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:21:21,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:21:21,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:22,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:22,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:22,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:22,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:22,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:21:22,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:21:22,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:21:22,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:21:22,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:22,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:22,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:22,042 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 22:21:22,048 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 22:21:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:21:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:21:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:21:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:21:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:21:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 22:21:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:21:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:21:22,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:21:22,229 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:21:22,231 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:21:22,391 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:21:22,395 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:21:22,399 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:21:22,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:22 BoogieIcfgContainer [2023-02-15 22:21:22,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:21:22,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:21:22,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:21:22,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:21:22,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:21:21" (1/3) ... [2023-02-15 22:21:22,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2c0e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:22, skipping insertion in model container [2023-02-15 22:21:22,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (2/3) ... [2023-02-15 22:21:22,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2c0e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:22, skipping insertion in model container [2023-02-15 22:21:22,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:22" (3/3) ... [2023-02-15 22:21:22,407 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-02-15 22:21:22,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:21:22,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-02-15 22:21:22,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:21:22,460 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;@7f720f4d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:21:22,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-02-15 22:21:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 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 22:21:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:21:22,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:22,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:21:22,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash 28698492, now seen corresponding path program 1 times [2023-02-15 22:21:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607368194] [2023-02-15 22:21:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:22,483 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 22:21:22,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:22,486 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 22:21:22,487 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 22:21:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:22,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:21:22,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:22,552 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 22:21:22,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:22,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:22,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607368194] [2023-02-15 22:21:22,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607368194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:22,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:22,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571460056] [2023-02-15 22:21:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:22,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:22,578 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 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 2.5) internal successors, (5), 3 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 22:21:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:22,631 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-15 22:21:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:22,637 INFO L225 Difference]: With dead ends: 40 [2023-02-15 22:21:22,637 INFO L226 Difference]: Without dead ends: 36 [2023-02-15 22:21:22,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:21:22,640 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:22,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-15 22:21:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-02-15 22:21:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.85) internal successors, (37), 29 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 22:21:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-02-15 22:21:22,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 5 [2023-02-15 22:21:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:22,660 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-02-15 22:21:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-02-15 22:21:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:21:22,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:22,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:21:22,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 22:21:22,870 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 22:21:22,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash 28698536, now seen corresponding path program 1 times [2023-02-15 22:21:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:22,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473871017] [2023-02-15 22:21:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:22,872 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 22:21:22,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:22,873 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 22:21:22,882 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 22:21:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:22,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:21:22,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:22,931 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 22:21:22,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:22,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:22,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473871017] [2023-02-15 22:21:22,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473871017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:22,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:22,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741972418] [2023-02-15 22:21:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:22,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:22,934 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 22:21:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:22,960 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-15 22:21:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 22:21:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:22,961 INFO L225 Difference]: With dead ends: 34 [2023-02-15 22:21:22,961 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 22:21:22,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:21:22,962 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:22,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 22:21:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-02-15 22:21:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 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 22:21:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-15 22:21:22,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2023-02-15 22:21:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:22,965 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-15 22:21:22,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 22:21:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-15 22:21:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:21:22,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:22,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:21:22,971 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 22:21:23,171 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 22:21:23,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2023-02-15 22:21:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:23,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244408933] [2023-02-15 22:21:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:23,173 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 22:21:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:23,176 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 22:21:23,178 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 22:21:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:23,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:21:23,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:23,264 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 22:21:23,277 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 22:21:23,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:23,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:23,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244408933] [2023-02-15 22:21:23,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244408933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:23,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:23,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474910882] [2023-02-15 22:21:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:23,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:23,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:23,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:23,283 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:23,335 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-02-15 22:21:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:23,336 INFO L225 Difference]: With dead ends: 23 [2023-02-15 22:21:23,336 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 22:21:23,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:21:23,337 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:23,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 22:21:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 22:21:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 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 22:21:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-02-15 22:21:23,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2023-02-15 22:21:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:23,340 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-02-15 22:21:23,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-02-15 22:21:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:21:23,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:23,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:21:23,349 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 22:21:23,547 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 22:21:23,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2023-02-15 22:21:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:23,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012287586] [2023-02-15 22:21:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:23,548 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 22:21:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:23,549 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 22:21:23,551 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 22:21:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:23,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:21:23,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:23,604 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 5 [2023-02-15 22:21:23,622 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 22:21:23,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:23,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:23,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012287586] [2023-02-15 22:21:23,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012287586] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:23,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:23,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117377256] [2023-02-15 22:21:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:23,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:21:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:21:23,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:21:23,624 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:23,650 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-02-15 22:21:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:21:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:23,651 INFO L225 Difference]: With dead ends: 21 [2023-02-15 22:21:23,651 INFO L226 Difference]: Without dead ends: 21 [2023-02-15 22:21:23,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:21:23,652 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:23,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-15 22:21:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 22:21:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 states have internal predecessors, (22), 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 22:21:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-02-15 22:21:23,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2023-02-15 22:21:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:23,654 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-02-15 22:21:23,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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 22:21:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-02-15 22:21:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:21:23,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:23,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:23,663 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 22:21:23,861 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 22:21:23,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -653129230, now seen corresponding path program 1 times [2023-02-15 22:21:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:23,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157245230] [2023-02-15 22:21:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:23,864 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 22:21:23,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:23,865 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 22:21:23,867 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 22:21:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:23,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:21:23,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:23,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:23,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157245230] [2023-02-15 22:21:23,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157245230] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:23,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:23,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:21:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286435884] [2023-02-15 22:21:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:23,941 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 22:21:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:24,007 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-02-15 22:21:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:24,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-02-15 22:21:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:24,008 INFO L225 Difference]: With dead ends: 36 [2023-02-15 22:21:24,009 INFO L226 Difference]: Without dead ends: 36 [2023-02-15 22:21:24,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:24,009 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:24,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-15 22:21:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2023-02-15 22:21:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 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 22:21:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-15 22:21:24,012 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2023-02-15 22:21:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:24,012 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-15 22:21:24,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 22:21:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-15 22:21:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:21:24,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:24,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:24,022 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 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:24,219 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 22:21:24,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -653129186, now seen corresponding path program 1 times [2023-02-15 22:21:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:24,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21275766] [2023-02-15 22:21:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:24,221 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 22:21:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:24,222 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 22:21:24,222 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 22:21:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:24,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:21:24,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:24,270 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 22:21:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:24,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:24,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21275766] [2023-02-15 22:21:24,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21275766] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:24,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:24,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583562138] [2023-02-15 22:21:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:24,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:24,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:24,293 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 22:21:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:24,359 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-02-15 22:21:24,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:24,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-02-15 22:21:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:24,360 INFO L225 Difference]: With dead ends: 27 [2023-02-15 22:21:24,360 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 22:21:24,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:24,361 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:24,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 22:21:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-15 22:21:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 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 22:21:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-15 22:21:24,363 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2023-02-15 22:21:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:24,363 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-15 22:21:24,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 22:21:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-15 22:21:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:21:24,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:24,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:24,370 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 22:21:24,570 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 22:21:24,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash -653129185, now seen corresponding path program 1 times [2023-02-15 22:21:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:24,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164611172] [2023-02-15 22:21:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:24,571 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 22:21:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:24,572 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 22:21:24,575 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 22:21:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:24,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:21:24,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:24,619 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 5 [2023-02-15 22:21:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:24,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:24,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:24,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164611172] [2023-02-15 22:21:24,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164611172] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:24,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:24,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:24,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076503916] [2023-02-15 22:21:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:24,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:24,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:24,664 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 22:21:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:24,731 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-15 22:21:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-02-15 22:21:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:24,732 INFO L225 Difference]: With dead ends: 31 [2023-02-15 22:21:24,732 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 22:21:24,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:24,732 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 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 22:21:24,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 22:21:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-02-15 22:21:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 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 22:21:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-02-15 22:21:24,735 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2023-02-15 22:21:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:24,735 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-02-15 22:21:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 22:21:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-02-15 22:21:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:21:24,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:24,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:24,745 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 22:21:24,941 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 22:21:24,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash -591922145, now seen corresponding path program 1 times [2023-02-15 22:21:24,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:24,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77129745] [2023-02-15 22:21:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:24,942 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 22:21:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:24,943 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 22:21:24,948 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 22:21:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:24,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:21:24,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:25,005 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 11 treesize of output 7 [2023-02-15 22:21:25,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:21:25,046 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 15 treesize of output 7 [2023-02-15 22:21:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:25,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:25,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77129745] [2023-02-15 22:21:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77129745] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:25,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:25,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882882151] [2023-02-15 22:21:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:25,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:21:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:21:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:25,055 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 22:21:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:25,141 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-02-15 22:21:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:21:25,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-02-15 22:21:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:25,142 INFO L225 Difference]: With dead ends: 28 [2023-02-15 22:21:25,142 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 22:21:25,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 22:21:25,143 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:25,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 22:21:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-02-15 22:21:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 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 22:21:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-02-15 22:21:25,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2023-02-15 22:21:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:25,145 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-02-15 22:21:25,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 22:21:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-02-15 22:21:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:21:25,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:25,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:25,155 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 22:21:25,352 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 22:21:25,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-15 22:21:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1187913323, now seen corresponding path program 1 times [2023-02-15 22:21:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:25,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370018957] [2023-02-15 22:21:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:25,354 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 22:21:25,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:25,355 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 22:21:25,356 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 22:21:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:25,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:21:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:25,445 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 22:21:25,446 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:21:25,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-02-15 22:21:25,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-02-15 22:21:25,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-02-15 22:21:25,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-02-15 22:21:25,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-02-15 22:21:25,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-02-15 22:21:25,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2023-02-15 22:21:25,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2023-02-15 22:21:25,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-02-15 22:21:25,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2023-02-15 22:21:25,458 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 22:21:25,649 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 22:21:25,652 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:25,654 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:21:25,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:25 BoogieIcfgContainer [2023-02-15 22:21:25,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:21:25,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:21:25,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:21:25,667 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:21:25,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:22" (3/4) ... [2023-02-15 22:21:25,669 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:21:25,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:21:25,669 INFO L158 Benchmark]: Toolchain (without parser) took 4054.44ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 70.5MB in the beginning and 67.0MB in the end (delta: 3.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2023-02-15 22:21:25,670 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:25,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.85ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 53.1MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 22:21:25,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.36ms. Allocated memory is still 94.4MB. Free memory was 53.1MB in the beginning and 51.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:25,670 INFO L158 Benchmark]: Boogie Preprocessor took 38.88ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 49.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:25,670 INFO L158 Benchmark]: RCFGBuilder took 383.92ms. Allocated memory is still 94.4MB. Free memory was 49.4MB in the beginning and 63.1MB in the end (delta: -13.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-02-15 22:21:25,671 INFO L158 Benchmark]: TraceAbstraction took 3263.45ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.7MB in the beginning and 67.0MB in the end (delta: -4.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:25,671 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 113.2MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:25,672 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.16ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.85ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 53.1MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.36ms. Allocated memory is still 94.4MB. Free memory was 53.1MB in the beginning and 51.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.88ms. Allocated memory is still 94.4MB. Free memory was 51.1MB in the beginning and 49.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 383.92ms. Allocated memory is still 94.4MB. Free memory was 49.4MB in the beginning and 63.1MB in the end (delta: -13.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3263.45ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.7MB in the beginning and 67.0MB in the end (delta: -4.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 113.2MB. Free memory is still 67.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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={6:0}] [L537] t->h = 1 VAL [p={0:0}, t={6:0}] [L538] t->n = p VAL [p={0:0}, t={6:0}] [L539] p = t VAL [p={6:0}, t={6:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={6:0}, t={6:0}] [L542] EXPR p->h VAL [p={6:0}, p->h=1, t={6:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={6:0}, p->n={0:0}, t={6:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={6: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: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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, 27 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 119 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=1, InterpolantAutomatonStates: 30, 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, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 9 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 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 22:21:25,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample