./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:50:37,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:50:37,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:50:38,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:50:38,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:50:38,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:50:38,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:50:38,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:50:38,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:50:38,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:50:38,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:50:38,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:50:38,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:50:38,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:50:38,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:50:38,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:50:38,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:50:38,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:50:38,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:50:38,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:50:38,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:50:38,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:50:38,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:50:38,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:50:38,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:50:38,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:50:38,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:50:38,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:50:38,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:50:38,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:50:38,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:50:38,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:50:38,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:50:38,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:50:38,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:50:38,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:50:38,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:50:38,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:50:38,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:50:38,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:50:38,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:50:38,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:50:38,078 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:50:38,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:50:38,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:50:38,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:50:38,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:50:38,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:50:38,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:50:38,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:50:38,082 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:50:38,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:50:38,082 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:50:38,083 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:50:38,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:50:38,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:50:38,084 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:50:38,084 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:50:38,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:50:38,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:50:38,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:50:38,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:38,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:50:38,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:50:38,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:50:38,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:50:38,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:50:38,086 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:50:38,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:50:38,086 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:50:38,086 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2023-02-15 21:50:38,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:50:38,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:50:38,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:50:38,343 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:50:38,343 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:50:38,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 21:50:39,322 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:50:39,500 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:50:39,502 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 21:50:39,513 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8051a176/e8a2985048cb41cdb9a0a5c4edcc8368/FLAG9cbd3bb3c [2023-02-15 21:50:39,523 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8051a176/e8a2985048cb41cdb9a0a5c4edcc8368 [2023-02-15 21:50:39,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:50:39,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:50:39,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:39,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:50:39,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:50:39,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d023b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39, skipping insertion in model container [2023-02-15 21:50:39,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:50:39,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:50:39,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:39,764 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:50:39,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:39,818 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:50:39,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39 WrapperNode [2023-02-15 21:50:39,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:39,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:50:39,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:50:39,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:50:39,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,847 INFO L138 Inliner]: procedures = 125, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2023-02-15 21:50:39,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:50:39,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:50:39,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:50:39,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:50:39,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:50:39,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:50:39,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:50:39,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:50:39,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (1/1) ... [2023-02-15 21:50:39,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:50:39,905 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 21:50:39,914 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 21:50:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:50:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:50:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 21:50:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:50:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:50:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:50:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:50:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:50:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:50:40,018 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:50:40,020 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:50:40,166 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:50:40,170 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:50:40,171 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 21:50:40,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:40 BoogieIcfgContainer [2023-02-15 21:50:40,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:50:40,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:50:40,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:50:40,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:50:40,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:50:39" (1/3) ... [2023-02-15 21:50:40,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a283ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:50:40, skipping insertion in model container [2023-02-15 21:50:40,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:39" (2/3) ... [2023-02-15 21:50:40,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a283ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:50:40, skipping insertion in model container [2023-02-15 21:50:40,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:40" (3/3) ... [2023-02-15 21:50:40,178 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2023-02-15 21:50:40,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:50:40,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-02-15 21:50:40,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:50:40,224 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;@f29d539, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:50:40,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-02-15 21:50:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:50:40,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:40,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:50:40,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 21:50:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327146493] [2023-02-15 21:50:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:40,421 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 21:50:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:40,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327146493] [2023-02-15 21:50:40,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327146493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:40,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:40,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:50:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681210040] [2023-02-15 21:50:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:40,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:50:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:50:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:40,449 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:40,511 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2023-02-15 21:50:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:40,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:50:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:40,528 INFO L225 Difference]: With dead ends: 48 [2023-02-15 21:50:40,530 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 21:50:40,532 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 21:50:40,534 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:40,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 21:50:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-02-15 21:50:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2023-02-15 21:50:40,560 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2023-02-15 21:50:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:40,561 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2023-02-15 21:50:40,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2023-02-15 21:50:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:50:40,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:40,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:50:40,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:50:40,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 21:50:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:40,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573624223] [2023-02-15 21:50:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:40,727 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 21:50:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573624223] [2023-02-15 21:50:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573624223] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:40,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:40,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:50:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354395251] [2023-02-15 21:50:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:40,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:50:40,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:40,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:50:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:40,729 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:40,751 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2023-02-15 21:50:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:40,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:50:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:40,752 INFO L225 Difference]: With dead ends: 38 [2023-02-15 21:50:40,752 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 21:50:40,752 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 21:50:40,753 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:40,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 21:50:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 21:50:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2023-02-15 21:50:40,758 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2023-02-15 21:50:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:40,758 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2023-02-15 21:50:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2023-02-15 21:50:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 21:50:40,759 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:40,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 21:50:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:50:40,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2023-02-15 21:50:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:40,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878687597] [2023-02-15 21:50:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:40,858 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 21:50:40,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:40,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878687597] [2023-02-15 21:50:40,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878687597] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:40,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:40,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:50:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319693700] [2023-02-15 21:50:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:40,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:50:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:50:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:50:40,861 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:40,902 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2023-02-15 21:50:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:50:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 21:50:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:40,903 INFO L225 Difference]: With dead ends: 44 [2023-02-15 21:50:40,903 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 21:50:40,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:50:40,904 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:40,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 21:50:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-15 21:50:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-02-15 21:50:40,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2023-02-15 21:50:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:40,908 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-02-15 21:50:40,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-02-15 21:50:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:50:40,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:40,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:40,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 21:50:40,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2023-02-15 21:50:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:40,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974832062] [2023-02-15 21:50:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:40,961 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 21:50:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:40,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974832062] [2023-02-15 21:50:40,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974832062] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:40,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:40,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:50:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647952128] [2023-02-15 21:50:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:40,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:50:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:50:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:50:40,964 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:41,024 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2023-02-15 21:50:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:50:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 21:50:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:41,025 INFO L225 Difference]: With dead ends: 39 [2023-02-15 21:50:41,025 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 21:50:41,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:41,026 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:41,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 21:50:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 21:50:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-02-15 21:50:41,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2023-02-15 21:50:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:41,030 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-02-15 21:50:41,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-02-15 21:50:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:50:41,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:41,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 21:50:41,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2023-02-15 21:50:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:41,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899558262] [2023-02-15 21:50:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:41,123 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 21:50:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:41,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899558262] [2023-02-15 21:50:41,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899558262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:41,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:41,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:50:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952531845] [2023-02-15 21:50:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:41,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:50:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:50:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:50:41,125 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:41,158 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2023-02-15 21:50:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:50:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 21:50:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:41,159 INFO L225 Difference]: With dead ends: 31 [2023-02-15 21:50:41,159 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 21:50:41,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:50:41,160 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:41,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 21:50:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-15 21:50:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2023-02-15 21:50:41,163 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2023-02-15 21:50:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:41,163 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2023-02-15 21:50:41,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2023-02-15 21:50:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:50:41,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:41,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 21:50:41,164 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2023-02-15 21:50:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:41,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256556838] [2023-02-15 21:50:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:41,272 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 21:50:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256556838] [2023-02-15 21:50:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256556838] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:41,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:50:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880305078] [2023-02-15 21:50:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:50:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:50:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:41,275 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:41,344 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2023-02-15 21:50:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:50:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 21:50:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:41,345 INFO L225 Difference]: With dead ends: 30 [2023-02-15 21:50:41,345 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 21:50:41,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:50:41,348 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 77 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:41,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 56 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 21:50:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 21:50:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2023-02-15 21:50:41,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2023-02-15 21:50:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:41,354 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2023-02-15 21:50:41,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2023-02-15 21:50:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 21:50:41,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:41,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 21:50:41,356 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2023-02-15 21:50:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:41,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840223523] [2023-02-15 21:50:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:41,498 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 21:50:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840223523] [2023-02-15 21:50:41,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840223523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:41,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:41,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:50:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890729766] [2023-02-15 21:50:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:41,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:50:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:50:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:41,501 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:41,580 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2023-02-15 21:50:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:50:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 21:50:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:41,581 INFO L225 Difference]: With dead ends: 29 [2023-02-15 21:50:41,581 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 21:50:41,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:50:41,582 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:41,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 37 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 21:50:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 21:50:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-02-15 21:50:41,585 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2023-02-15 21:50:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:41,585 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-02-15 21:50:41,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-02-15 21:50:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:50:41,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:41,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 21:50:41,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2023-02-15 21:50:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:41,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320478628] [2023-02-15 21:50:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:41,813 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 21:50:41,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:50:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320478628] [2023-02-15 21:50:41,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320478628] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:41,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:41,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:50:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694001131] [2023-02-15 21:50:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:41,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:50:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:50:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:50:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:41,816 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:41,909 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2023-02-15 21:50:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:50:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 21:50:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:41,910 INFO L225 Difference]: With dead ends: 30 [2023-02-15 21:50:41,910 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 21:50:41,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:50:41,911 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:41,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 45 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 21:50:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-02-15 21:50:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2023-02-15 21:50:41,925 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2023-02-15 21:50:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:41,926 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2023-02-15 21:50:41,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2023-02-15 21:50:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:50:41,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:41,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 21:50:41,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2023-02-15 21:50:41,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:50:41,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910897996] [2023-02-15 21:50:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:41,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:50:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:50:41,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 21:50:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:50:41,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 21:50:41,977 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 21:50:41,978 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2023-02-15 21:50:41,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2023-02-15 21:50:41,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2023-02-15 21:50:41,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2023-02-15 21:50:41,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2023-02-15 21:50:41,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2023-02-15 21:50:41,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2023-02-15 21:50:41,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2023-02-15 21:50:41,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2023-02-15 21:50:41,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2023-02-15 21:50:41,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2023-02-15 21:50:41,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2023-02-15 21:50:41,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2023-02-15 21:50:41,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 21:50:41,984 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,987 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 21:50:42,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 09:50:42 BoogieIcfgContainer [2023-02-15 21:50:42,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 21:50:42,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 21:50:42,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 21:50:42,016 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 21:50:42,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:40" (3/4) ... [2023-02-15 21:50:42,018 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 21:50:42,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 21:50:42,018 INFO L158 Benchmark]: Toolchain (without parser) took 2492.86ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 46.0MB in the end (delta: 66.3MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2023-02-15 21:50:42,018 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:50:42,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.99ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 96.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 21:50:42,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.64ms. Allocated memory is still 157.3MB. Free memory was 95.5MB in the beginning and 94.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:50:42,019 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 157.3MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:50:42,019 INFO L158 Benchmark]: RCFGBuilder took 295.08ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 79.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 21:50:42,020 INFO L158 Benchmark]: TraceAbstraction took 1841.39ms. Allocated memory is still 157.3MB. Free memory was 78.8MB in the beginning and 46.0MB in the end (delta: 32.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-02-15 21:50:42,020 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 157.3MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:50:42,021 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 121.6MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.99ms. Allocated memory is still 157.3MB. Free memory was 112.3MB in the beginning and 96.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.64ms. Allocated memory is still 157.3MB. Free memory was 95.5MB in the beginning and 94.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 157.3MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.08ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 79.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1841.39ms. Allocated memory is still 157.3MB. Free memory was 78.8MB in the beginning and 46.0MB in the end (delta: 32.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 157.3MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={3:0}, pdata={3:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={-2:0}, pdata={3:0}, pdata={3:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={3:0}, data={3:0}, data->lo={-1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={3:0}, data={3:0}, data->hi={-2:0}, lo={-1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L540] data->lo = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L541] data->hi = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 347 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 160 mSDtfsCounter, 347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 21:50:42,042 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/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:50:43,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:50:43,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:50:43,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:50:43,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:50:43,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:50:43,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:50:43,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:50:43,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:50:43,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:50:43,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:50:43,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:50:43,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:50:43,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:50:43,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:50:43,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:50:43,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:50:43,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:50:43,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:50:43,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:50:43,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:50:43,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:50:43,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:50:43,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:50:43,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:50:43,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:50:43,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:50:43,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:50:43,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:50:43,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:50:43,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:50:43,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:50:43,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:50:43,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:50:43,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:50:43,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:50:43,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:50:43,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:50:43,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:50:43,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:50:43,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:50:43,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 21:50:44,019 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:50:44,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:50:44,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:50:44,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:50:44,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:50:44,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:50:44,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:50:44,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:50:44,022 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:50:44,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:50:44,022 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:50:44,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:50:44,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:50:44,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:50:44,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:50:44,023 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:50:44,023 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:50:44,023 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:50:44,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:50:44,024 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:50:44,024 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 21:50:44,024 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 21:50:44,024 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:50:44,024 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:50:44,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:50:44,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:50:44,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:50:44,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:44,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:50:44,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:50:44,025 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 21:50:44,025 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 21:50:44,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:50:44,026 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:50:44,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:50:44,026 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 21:50:44,026 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:50:44,026 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2023-02-15 21:50:44,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:50:44,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:50:44,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:50:44,278 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:50:44,279 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:50:44,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 21:50:45,319 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:50:45,555 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:50:45,558 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2023-02-15 21:50:45,585 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a856dfd3/40515f09ffab4d14aec3068051ab6a22/FLAG1c2a700f5 [2023-02-15 21:50:45,603 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a856dfd3/40515f09ffab4d14aec3068051ab6a22 [2023-02-15 21:50:45,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:50:45,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:50:45,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:45,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:50:45,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:50:45,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:45,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1486dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45, skipping insertion in model container [2023-02-15 21:50:45,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:45,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:50:45,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:50:45,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:45,890 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:50:45,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:45,976 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:50:45,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45 WrapperNode [2023-02-15 21:50:45,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:45,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:50:45,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:50:45,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:50:45,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:45,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,012 INFO L138 Inliner]: procedures = 126, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2023-02-15 21:50:46,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:50:46,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:50:46,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:50:46,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:50:46,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:50:46,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:50:46,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:50:46,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:50:46,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (1/1) ... [2023-02-15 21:50:46,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:46,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:50:46,062 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 21:50:46,112 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 21:50:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:50:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:50:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 21:50:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:50:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:50:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:50:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 21:50:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:50:46,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:50:46,265 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:50:46,266 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:50:46,502 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:50:46,505 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:50:46,506 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 21:50:46,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:46 BoogieIcfgContainer [2023-02-15 21:50:46,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:50:46,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:50:46,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:50:46,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:50:46,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:50:45" (1/3) ... [2023-02-15 21:50:46,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b28872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:50:46, skipping insertion in model container [2023-02-15 21:50:46,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:45" (2/3) ... [2023-02-15 21:50:46,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b28872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:50:46, skipping insertion in model container [2023-02-15 21:50:46,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:46" (3/3) ... [2023-02-15 21:50:46,511 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2023-02-15 21:50:46,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:50:46,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-02-15 21:50:46,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:50:46,564 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;@41ee0e6c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:50:46,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-02-15 21:50:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:50:46,570 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:46,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:50:46,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 21:50:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:46,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569600256] [2023-02-15 21:50:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:46,586 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 21:50:46,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:46,588 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 21:50:46,590 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 21:50:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:46,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 21:50:46,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:46,724 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 21:50:46,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 21:50:46,746 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 21:50:46,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:46,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:46,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569600256] [2023-02-15 21:50:46,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569600256] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:46,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:46,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:50:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961846839] [2023-02-15 21:50:46,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:46,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:50:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:50:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:46,770 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:46,835 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2023-02-15 21:50:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:50:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:46,842 INFO L225 Difference]: With dead ends: 48 [2023-02-15 21:50:46,842 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 21:50:46,843 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 21:50:46,845 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:46,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 21:50:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-02-15 21:50:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2023-02-15 21:50:46,864 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2023-02-15 21:50:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:46,865 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2023-02-15 21:50:46,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2023-02-15 21:50:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:50:46,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:46,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:50:46,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:47,072 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 21:50:47,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 21:50:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:47,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711335717] [2023-02-15 21:50:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:47,075 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 21:50:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:47,076 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 21:50:47,104 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 21:50:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:47,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:50:47,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:47,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:47,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-15 21:50:47,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 21:50:47,184 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 21:50:47,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:47,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:47,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711335717] [2023-02-15 21:50:47,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711335717] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:47,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:47,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:50:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117170895] [2023-02-15 21:50:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:47,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:50:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:50:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:47,188 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:47,240 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2023-02-15 21:50:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:50:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:47,241 INFO L225 Difference]: With dead ends: 38 [2023-02-15 21:50:47,241 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 21:50:47,241 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 21:50:47,242 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:47,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:50:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 21:50:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 21:50:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2023-02-15 21:50:47,246 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2023-02-15 21:50:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:47,246 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2023-02-15 21:50:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2023-02-15 21:50:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 21:50:47,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:47,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 21:50:47,255 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 21:50:47,453 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 21:50:47,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2023-02-15 21:50:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:47,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941338595] [2023-02-15 21:50:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:47,455 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 21:50:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:47,456 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 21:50:47,458 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 21:50:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:47,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 21:50:47,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:47,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:47,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-15 21:50:47,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 21:50:47,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:47,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 21:50:47,608 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:50:47,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 21:50:47,612 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 21:50:47,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:47,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:47,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941338595] [2023-02-15 21:50:47,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941338595] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:47,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:47,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:50:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550494347] [2023-02-15 21:50:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:47,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:50:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:50:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:50:47,615 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:47,699 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2023-02-15 21:50:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:50:47,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 21:50:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:47,700 INFO L225 Difference]: With dead ends: 44 [2023-02-15 21:50:47,700 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 21:50:47,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:50:47,701 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:47,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 21:50:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-15 21:50:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-02-15 21:50:47,704 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2023-02-15 21:50:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:47,704 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-02-15 21:50:47,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-02-15 21:50:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:50:47,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:47,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:47,716 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 (4)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:47,916 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 21:50:47,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2023-02-15 21:50:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:47,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700515212] [2023-02-15 21:50:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:47,919 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 21:50:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:47,921 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 21:50:47,922 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 21:50:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:48,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:50:48,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:48,038 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 21:50:48,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:48,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:48,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700515212] [2023-02-15 21:50:48,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700515212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:48,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:48,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:50:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67267245] [2023-02-15 21:50:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:48,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:50:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:48,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:50:48,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:50:48,041 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:48,137 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2023-02-15 21:50:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:50:48,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 21:50:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:48,138 INFO L225 Difference]: With dead ends: 39 [2023-02-15 21:50:48,138 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 21:50:48,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:48,139 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:48,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 21:50:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 21:50:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-02-15 21:50:48,142 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2023-02-15 21:50:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:48,142 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-02-15 21:50:48,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-02-15 21:50:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:50:48,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:48,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:48,153 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 21:50:48,350 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 21:50:48,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:48,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2023-02-15 21:50:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:48,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119116526] [2023-02-15 21:50:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:48,351 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 21:50:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:48,352 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 21:50:48,355 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 21:50:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:48,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 21:50:48,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:48,458 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 21:50:48,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:48,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:48,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119116526] [2023-02-15 21:50:48,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119116526] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:48,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:48,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:50:48,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558027121] [2023-02-15 21:50:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:48,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:50:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:50:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:50:48,460 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:48,578 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2023-02-15 21:50:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:50:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 21:50:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:48,579 INFO L225 Difference]: With dead ends: 31 [2023-02-15 21:50:48,579 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 21:50:48,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:50:48,580 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:48,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 21:50:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-15 21:50:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2023-02-15 21:50:48,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2023-02-15 21:50:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:48,583 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2023-02-15 21:50:48,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2023-02-15 21:50:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:50:48,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:48,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:48,602 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 21:50:48,790 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 21:50:48,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2023-02-15 21:50:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590801183] [2023-02-15 21:50:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:48,792 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 21:50:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:48,794 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 21:50:48,796 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 21:50:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:48,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 21:50:48,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:48,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:48,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 21:50:49,004 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 21:50:49,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:49,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:49,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590801183] [2023-02-15 21:50:49,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590801183] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:49,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:49,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:50:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123759731] [2023-02-15 21:50:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:49,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:50:49,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:49,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:50:49,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:50:49,011 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:49,290 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2023-02-15 21:50:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:50:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 21:50:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:49,291 INFO L225 Difference]: With dead ends: 33 [2023-02-15 21:50:49,291 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 21:50:49,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:50:49,292 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:49,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 63 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 21:50:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-02-15 21:50:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-02-15 21:50:49,294 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2023-02-15 21:50:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:49,294 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-02-15 21:50:49,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-02-15 21:50:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 21:50:49,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:49,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:49,319 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 21:50:49,520 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 21:50:49,521 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2023-02-15 21:50:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:49,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266439806] [2023-02-15 21:50:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:49,522 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 21:50:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:49,537 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 21:50:49,561 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 21:50:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:49,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 21:50:49,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:49,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:49,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 21:50:49,896 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 21:50:49,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:49,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:49,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266439806] [2023-02-15 21:50:49,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266439806] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:49,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:49,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:50:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056431458] [2023-02-15 21:50:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:49,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 21:50:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 21:50:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:50:49,898 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:50,563 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2023-02-15 21:50:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:50:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 21:50:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:50,564 INFO L225 Difference]: With dead ends: 31 [2023-02-15 21:50:50,564 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 21:50:50,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:50:50,565 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:50,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 25 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:50:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 21:50:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-15 21:50:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2023-02-15 21:50:50,567 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2023-02-15 21:50:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:50,567 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2023-02-15 21:50:50,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2023-02-15 21:50:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:50:50,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:50,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:50,574 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 (8)] Ended with exit code 0 [2023-02-15 21:50:50,772 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 21:50:50,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2023-02-15 21:50:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588266025] [2023-02-15 21:50:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:50,773 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 21:50:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:50,775 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 21:50:50,777 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 21:50:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:50,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:50:50,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:50,858 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 21:50:50,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:50,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 21:50:50,934 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 21:50:50,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:50,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:50,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588266025] [2023-02-15 21:50:50,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588266025] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:50,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:50,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:50:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718703626] [2023-02-15 21:50:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:50,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:50:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:50:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:50:50,936 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:51,251 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2023-02-15 21:50:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:50:51,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 21:50:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:51,252 INFO L225 Difference]: With dead ends: 28 [2023-02-15 21:50:51,252 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 21:50:51,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:50:51,253 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:51,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 34 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:50:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 21:50:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-15 21:50:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-02-15 21:50:51,255 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 15 [2023-02-15 21:50:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:51,255 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-02-15 21:50:51,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-02-15 21:50:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:50:51,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:51,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:51,264 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 21:50:51,455 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 21:50:51,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2023-02-15 21:50:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2023-02-15 21:50:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833620125] [2023-02-15 21:50:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:51,457 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 21:50:51,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:51,458 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 21:50:51,460 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 21:50:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:50:51,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 21:50:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:50:51,604 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 21:50:51,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 21:50:51,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2023-02-15 21:50:51,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2023-02-15 21:50:51,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2023-02-15 21:50:51,635 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 (10)] Ended with exit code 0 [2023-02-15 21:50:51,808 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 21:50:51,810 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:51,812 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 21:50:51,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 09:50:51 BoogieIcfgContainer [2023-02-15 21:50:51,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 21:50:51,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 21:50:51,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 21:50:51,830 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 21:50:51,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:46" (3/4) ... [2023-02-15 21:50:51,832 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 21:50:51,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 21:50:51,832 INFO L158 Benchmark]: Toolchain (without parser) took 6226.09ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 70.3MB in the beginning and 51.7MB in the end (delta: 18.6MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2023-02-15 21:50:51,832 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:50:51,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.37ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 53.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 21:50:51,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 94.4MB. Free memory was 53.0MB in the beginning and 51.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:50:51,833 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 94.4MB. Free memory was 51.2MB in the beginning and 49.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:50:51,833 INFO L158 Benchmark]: RCFGBuilder took 468.22ms. Allocated memory is still 94.4MB. Free memory was 49.6MB in the beginning and 61.2MB in the end (delta: -11.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-02-15 21:50:51,833 INFO L158 Benchmark]: TraceAbstraction took 5321.30ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 60.5MB in the beginning and 51.7MB in the end (delta: 8.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-02-15 21:50:51,833 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 113.2MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:50:51,834 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 62.9MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.37ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 53.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.32ms. Allocated memory is still 94.4MB. Free memory was 53.0MB in the beginning and 51.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 94.4MB. Free memory was 51.2MB in the beginning and 49.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 468.22ms. Allocated memory is still 94.4MB. Free memory was 49.6MB in the beginning and 61.2MB in the end (delta: -11.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5321.30ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 60.5MB in the beginning and 51.7MB in the end (delta: 8.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 113.2MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={16387:0}, pdata={-2147483646:0}, pdata={-2147483646:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={4:0}, pdata={-2147483646:0}, pdata={-2147483646:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={-2147483646:0}, data={-2147483646:0}, data->lo={16387:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={-2147483646:0}, data={-2147483646:0}, data->hi={4:0}, lo={16387:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={-2147483646:0}, data={-2147483646:0}, hi={4:0}, lo={16387:0}] [L540] data->lo = (void *) 0 VAL [data={-2147483646:0}, data={-2147483646:0}, hi={4:0}, lo={16387:0}] [L541] data->hi = (void *) 0 VAL [data={-2147483646:0}, data={-2147483646:0}, hi={4:0}, lo={16387:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 153 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 12 QuantifiedInterpolants, 555 SizeOfPredicates, 66 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 21:50:51,852 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