./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e 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/lockfree-3.1.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:14:30,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:14:30,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:14:30,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:14:30,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:14:30,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:14:30,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:14:30,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:14:30,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:14:30,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:14:30,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:14:30,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:14:30,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:14:30,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:14:30,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:14:30,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:14:30,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:14:30,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:14:30,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:14:30,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:14:30,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:14:30,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:14:30,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:14:30,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:14:30,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:14:30,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:14:30,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:14:30,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:14:30,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:14:30,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:14:30,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:14:30,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:14:30,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:14:30,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:14:30,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:14:30,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:14:30,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:14:30,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:14:30,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:14:30,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:14:30,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:14:30,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:14:30,760 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:14:30,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:14:30,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:14:30,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:14:30,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:14:30,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:14:30,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:14:30,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:14:30,763 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:14:30,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:14:30,764 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:14:30,765 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:14:30,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:14:30,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:14:30,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:14:30,765 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:14:30,766 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:14:30,766 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:14:30,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:14:30,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:14:30,766 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:14:30,766 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:14:30,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:14:30,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:14:30,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:14:30,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:14:30,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:14:30,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:14:30,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:14:30,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:14:30,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:14:30,768 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:14:30,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:14:30,769 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:14:30,769 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2023-02-17 08:14:31,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:14:31,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:14:31,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:14:31,028 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:14:31,028 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:14:31,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-17 08:14:32,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:14:32,441 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:14:32,442 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-17 08:14:32,451 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5dcfac0/47e1d6ca48434cdbade2d91e3c61a116/FLAG2e7c3d087 [2023-02-17 08:14:32,462 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5dcfac0/47e1d6ca48434cdbade2d91e3c61a116 [2023-02-17 08:14:32,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:14:32,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:14:32,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:14:32,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:14:32,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:14:32,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4831a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32, skipping insertion in model container [2023-02-17 08:14:32,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:14:32,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:14:32,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:14:32,843 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:14:32,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:14:32,910 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:14:32,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32 WrapperNode [2023-02-17 08:14:32,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:14:32,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:14:32,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:14:32,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:14:32,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,966 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2023-02-17 08:14:32,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:14:32,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:14:32,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:14:32,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:14:32,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:32,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:33,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:33,010 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:33,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:33,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:14:33,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:14:33,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:14:33,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:14:33,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (1/1) ... [2023-02-17 08:14:33,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:14:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:33,053 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-17 08:14:33,057 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-17 08:14:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 08:14:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 08:14:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:14:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:14:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:14:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:14:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:14:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 08:14:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:14:33,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:14:33,188 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:14:33,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:14:33,430 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:14:33,436 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:14:33,436 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 08:14:33,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:14:33 BoogieIcfgContainer [2023-02-17 08:14:33,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:14:33,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:14:33,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:14:33,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:14:33,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:14:32" (1/3) ... [2023-02-17 08:14:33,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3834c840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:14:33, skipping insertion in model container [2023-02-17 08:14:33,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:32" (2/3) ... [2023-02-17 08:14:33,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3834c840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:14:33, skipping insertion in model container [2023-02-17 08:14:33,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:14:33" (3/3) ... [2023-02-17 08:14:33,459 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2023-02-17 08:14:33,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:14:33,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-17 08:14:33,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:14:33,550 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;@2ab61435, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:14:33,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-17 08:14:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 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-17 08:14:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:14:33,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:33,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:14:33,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2023-02-17 08:14:33,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:33,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949536666] [2023-02-17 08:14:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:33,709 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-17 08:14:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:33,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949536666] [2023-02-17 08:14:33,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949536666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:33,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:33,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141278495] [2023-02-17 08:14:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:33,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 08:14:33,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 08:14:33,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 08:14:33,756 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:33,779 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-02-17 08:14:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 08:14:33,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 08:14:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:33,792 INFO L225 Difference]: With dead ends: 64 [2023-02-17 08:14:33,792 INFO L226 Difference]: Without dead ends: 62 [2023-02-17 08:14:33,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 08:14:33,798 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:33,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-17 08:14:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-17 08:14:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 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-17 08:14:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-02-17 08:14:33,828 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2023-02-17 08:14:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:33,829 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-02-17 08:14:33,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-02-17 08:14:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:14:33,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:33,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:33,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 08:14:33,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:33,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2023-02-17 08:14:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:33,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008847135] [2023-02-17 08:14:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:33,895 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-17 08:14:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:33,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008847135] [2023-02-17 08:14:33,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008847135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:33,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:33,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:14:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766996093] [2023-02-17 08:14:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:33,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:33,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:33,899 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-17 08:14:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:33,914 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-02-17 08:14:33,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:33,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-02-17 08:14:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:33,916 INFO L225 Difference]: With dead ends: 63 [2023-02-17 08:14:33,916 INFO L226 Difference]: Without dead ends: 63 [2023-02-17 08:14:33,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:33,918 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:33,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-17 08:14:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-17 08:14:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 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-17 08:14:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2023-02-17 08:14:33,925 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2023-02-17 08:14:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:33,925 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2023-02-17 08:14:33,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-17 08:14:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2023-02-17 08:14:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:14:33,926 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:33,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:33,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 08:14:33,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2023-02-17 08:14:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:33,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98441914] [2023-02-17 08:14:33,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:33,970 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-17 08:14:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:33,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98441914] [2023-02-17 08:14:33,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98441914] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:33,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:33,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277952024] [2023-02-17 08:14:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:33,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:33,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:33,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:33,973 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 08:14:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,011 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2023-02-17 08:14:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:34,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-02-17 08:14:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,014 INFO L225 Difference]: With dead ends: 111 [2023-02-17 08:14:34,014 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 08:14:34,014 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-17 08:14:34,015 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 08:14:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2023-02-17 08:14:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 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-17 08:14:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2023-02-17 08:14:34,038 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2023-02-17 08:14:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,038 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2023-02-17 08:14:34,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 08:14:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2023-02-17 08:14:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 08:14:34,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 08:14:34,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2023-02-17 08:14:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505343712] [2023-02-17 08:14:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,100 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-17 08:14:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505343712] [2023-02-17 08:14:34,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505343712] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:14:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264349000] [2023-02-17 08:14:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:14:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:14:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:14:34,103 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-17 08:14:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,135 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2023-02-17 08:14:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:14:34,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-17 08:14:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,137 INFO L225 Difference]: With dead ends: 101 [2023-02-17 08:14:34,137 INFO L226 Difference]: Without dead ends: 101 [2023-02-17 08:14:34,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:34,138 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-17 08:14:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-02-17 08:14:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 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-17 08:14:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2023-02-17 08:14:34,156 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2023-02-17 08:14:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,156 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2023-02-17 08:14:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-17 08:14:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2023-02-17 08:14:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 08:14:34,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 08:14:34,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2023-02-17 08:14:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255355048] [2023-02-17 08:14:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,218 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-17 08:14:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255355048] [2023-02-17 08:14:34,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255355048] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805501173] [2023-02-17 08:14:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:34,223 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,285 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2023-02-17 08:14:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,287 INFO L225 Difference]: With dead ends: 177 [2023-02-17 08:14:34,288 INFO L226 Difference]: Without dead ends: 174 [2023-02-17 08:14:34,289 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-17 08:14:34,290 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-17 08:14:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2023-02-17 08:14:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 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-17 08:14:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2023-02-17 08:14:34,301 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2023-02-17 08:14:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,301 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2023-02-17 08:14:34,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2023-02-17 08:14:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 08:14:34,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 08:14:34,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2023-02-17 08:14:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410360853] [2023-02-17 08:14:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,350 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-17 08:14:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410360853] [2023-02-17 08:14:34,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410360853] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738486841] [2023-02-17 08:14:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:34,353 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,404 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2023-02-17 08:14:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:34,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,407 INFO L225 Difference]: With dead ends: 229 [2023-02-17 08:14:34,407 INFO L226 Difference]: Without dead ends: 229 [2023-02-17 08:14:34,407 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-17 08:14:34,408 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-17 08:14:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 208. [2023-02-17 08:14:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 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-17 08:14:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2023-02-17 08:14:34,420 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2023-02-17 08:14:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,421 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2023-02-17 08:14:34,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2023-02-17 08:14:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 08:14:34,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 08:14:34,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2023-02-17 08:14:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324328980] [2023-02-17 08:14:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,527 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-17 08:14:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324328980] [2023-02-17 08:14:34,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324328980] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108491699] [2023-02-17 08:14:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:34,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:34,532 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,580 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2023-02-17 08:14:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,582 INFO L225 Difference]: With dead ends: 224 [2023-02-17 08:14:34,583 INFO L226 Difference]: Without dead ends: 224 [2023-02-17 08:14:34,584 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-17 08:14:34,590 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-17 08:14:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2023-02-17 08:14:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 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-17 08:14:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2023-02-17 08:14:34,602 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2023-02-17 08:14:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,602 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2023-02-17 08:14:34,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 08:14:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2023-02-17 08:14:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 08:14:34,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 08:14:34,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2023-02-17 08:14:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148839216] [2023-02-17 08:14:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,651 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-17 08:14:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148839216] [2023-02-17 08:14:34,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148839216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:14:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249735496] [2023-02-17 08:14:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:14:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:14:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:34,654 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-17 08:14:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,694 INFO L93 Difference]: Finished difference Result 445 states and 675 transitions. [2023-02-17 08:14:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:14:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-02-17 08:14:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,697 INFO L225 Difference]: With dead ends: 445 [2023-02-17 08:14:34,697 INFO L226 Difference]: Without dead ends: 445 [2023-02-17 08:14:34,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:14:34,698 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 105 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-17 08:14:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 354. [2023-02-17 08:14:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 338 states have (on average 1.680473372781065) internal successors, (568), 353 states have internal predecessors, (568), 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-17 08:14:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 568 transitions. [2023-02-17 08:14:34,708 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 568 transitions. Word has length 9 [2023-02-17 08:14:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,709 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 568 transitions. [2023-02-17 08:14:34,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-17 08:14:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 568 transitions. [2023-02-17 08:14:34,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:14:34,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 08:14:34,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2023-02-17 08:14:34,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903246418] [2023-02-17 08:14:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,779 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-17 08:14:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903246418] [2023-02-17 08:14:34,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903246418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:14:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648359525] [2023-02-17 08:14:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:14:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:14:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:34,782 INFO L87 Difference]: Start difference. First operand 354 states and 568 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,823 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2023-02-17 08:14:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:14:34,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 08:14:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,827 INFO L225 Difference]: With dead ends: 826 [2023-02-17 08:14:34,827 INFO L226 Difference]: Without dead ends: 826 [2023-02-17 08:14:34,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:14:34,830 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-02-17 08:14:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 594. [2023-02-17 08:14:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 578 states have (on average 1.5778546712802768) internal successors, (912), 593 states have internal predecessors, (912), 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-17 08:14:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 912 transitions. [2023-02-17 08:14:34,844 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 912 transitions. Word has length 10 [2023-02-17 08:14:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,845 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 912 transitions. [2023-02-17 08:14:34,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 912 transitions. [2023-02-17 08:14:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:14:34,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 08:14:34,848 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2023-02-17 08:14:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032502077] [2023-02-17 08:14:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:34,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032502077] [2023-02-17 08:14:34,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032502077] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:34,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:14:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124454252] [2023-02-17 08:14:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:34,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:14:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:14:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:34,936 INFO L87 Difference]: Start difference. First operand 594 states and 912 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-17 08:14:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:34,973 INFO L93 Difference]: Finished difference Result 906 states and 1406 transitions. [2023-02-17 08:14:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:14:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2023-02-17 08:14:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:34,976 INFO L225 Difference]: With dead ends: 906 [2023-02-17 08:14:34,977 INFO L226 Difference]: Without dead ends: 906 [2023-02-17 08:14:34,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:14:34,977 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:34,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 279 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-02-17 08:14:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 888. [2023-02-17 08:14:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 872 states have (on average 1.603211009174312) internal successors, (1398), 887 states have internal predecessors, (1398), 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-17 08:14:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1398 transitions. [2023-02-17 08:14:34,992 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1398 transitions. Word has length 16 [2023-02-17 08:14:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:34,993 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1398 transitions. [2023-02-17 08:14:34,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-17 08:14:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1398 transitions. [2023-02-17 08:14:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:14:34,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:34,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:34,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 08:14:34,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2023-02-17 08:14:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:34,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792264430] [2023-02-17 08:14:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792264430] [2023-02-17 08:14:35,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792264430] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865976100] [2023-02-17 08:14:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:35,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:35,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 08:14:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:35,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:14:35,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:35,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865976100] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:35,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:35,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-02-17 08:14:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513469267] [2023-02-17 08:14:35,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:35,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:14:35,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:35,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:14:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:14:35,248 INFO L87 Difference]: Start difference. First operand 888 states and 1398 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-17 08:14:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:35,368 INFO L93 Difference]: Finished difference Result 2236 states and 3388 transitions. [2023-02-17 08:14:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:14:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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) Word has length 16 [2023-02-17 08:14:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:35,376 INFO L225 Difference]: With dead ends: 2236 [2023-02-17 08:14:35,377 INFO L226 Difference]: Without dead ends: 2236 [2023-02-17 08:14:35,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:14:35,378 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 359 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:35,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 543 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2023-02-17 08:14:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1272. [2023-02-17 08:14:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1256 states have (on average 1.5684713375796178) internal successors, (1970), 1271 states have internal predecessors, (1970), 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-17 08:14:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1970 transitions. [2023-02-17 08:14:35,407 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1970 transitions. Word has length 16 [2023-02-17 08:14:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:35,408 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1970 transitions. [2023-02-17 08:14:35,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-17 08:14:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1970 transitions. [2023-02-17 08:14:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:14:35,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:35,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:35,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:35,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-17 08:14:35,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:35,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1214108262, now seen corresponding path program 1 times [2023-02-17 08:14:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:35,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763530129] [2023-02-17 08:14:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:14:35,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:35,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763530129] [2023-02-17 08:14:35,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763530129] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:35,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:35,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:14:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274301704] [2023-02-17 08:14:35,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:35,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:14:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:35,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:14:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:14:35,688 INFO L87 Difference]: Start difference. First operand 1272 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-17 08:14:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:35,730 INFO L93 Difference]: Finished difference Result 473 states and 648 transitions. [2023-02-17 08:14:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:14:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2023-02-17 08:14:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:35,733 INFO L225 Difference]: With dead ends: 473 [2023-02-17 08:14:35,733 INFO L226 Difference]: Without dead ends: 473 [2023-02-17 08:14:35,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:35,734 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 106 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:35,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 243 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-17 08:14:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 353. [2023-02-17 08:14:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 341 states have (on average 1.501466275659824) internal successors, (512), 352 states have internal predecessors, (512), 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-17 08:14:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 512 transitions. [2023-02-17 08:14:35,740 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 512 transitions. Word has length 21 [2023-02-17 08:14:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:35,740 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 512 transitions. [2023-02-17 08:14:35,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-17 08:14:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 512 transitions. [2023-02-17 08:14:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 08:14:35,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:35,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:35,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 08:14:35,743 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2023-02-17 08:14:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:35,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883976499] [2023-02-17 08:14:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883976499] [2023-02-17 08:14:35,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883976499] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369950714] [2023-02-17 08:14:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:35,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:35,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 08:14:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:35,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:14:35,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:35,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:35,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369950714] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:35,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:35,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-17 08:14:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095047443] [2023-02-17 08:14:35,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:35,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:14:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:35,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:14:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:14:35,996 INFO L87 Difference]: Start difference. First operand 353 states and 512 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:36,068 INFO L93 Difference]: Finished difference Result 1047 states and 1508 transitions. [2023-02-17 08:14:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:14:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-17 08:14:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:36,072 INFO L225 Difference]: With dead ends: 1047 [2023-02-17 08:14:36,072 INFO L226 Difference]: Without dead ends: 1047 [2023-02-17 08:14:36,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:36,073 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 176 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:36,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 159 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-02-17 08:14:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1007. [2023-02-17 08:14:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 995 states have (on average 1.485427135678392) internal successors, (1478), 1006 states have internal predecessors, (1478), 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-17 08:14:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1478 transitions. [2023-02-17 08:14:36,090 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1478 transitions. Word has length 24 [2023-02-17 08:14:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:36,090 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1478 transitions. [2023-02-17 08:14:36,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1478 transitions. [2023-02-17 08:14:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:14:36,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:36,094 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:36,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 08:14:36,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 08:14:36,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2023-02-17 08:14:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:36,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003756084] [2023-02-17 08:14:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003756084] [2023-02-17 08:14:36,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003756084] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280323225] [2023-02-17 08:14:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:36,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:36,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:36,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:36,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 08:14:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:36,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:14:36,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:36,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:36,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280323225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:36,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:36,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-02-17 08:14:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491096275] [2023-02-17 08:14:36,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:36,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:14:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:14:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:14:36,508 INFO L87 Difference]: Start difference. First operand 1007 states and 1478 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-17 08:14:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:36,651 INFO L93 Difference]: Finished difference Result 3857 states and 5384 transitions. [2023-02-17 08:14:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 08:14:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 27 [2023-02-17 08:14:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:36,665 INFO L225 Difference]: With dead ends: 3857 [2023-02-17 08:14:36,665 INFO L226 Difference]: Without dead ends: 3857 [2023-02-17 08:14:36,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-02-17 08:14:36,666 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 625 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:36,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 535 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2023-02-17 08:14:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2177. [2023-02-17 08:14:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 2165 states have (on average 1.464203233256351) internal successors, (3170), 2176 states have internal predecessors, (3170), 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-17 08:14:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3170 transitions. [2023-02-17 08:14:36,715 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3170 transitions. Word has length 27 [2023-02-17 08:14:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:36,715 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3170 transitions. [2023-02-17 08:14:36,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-17 08:14:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3170 transitions. [2023-02-17 08:14:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:14:36,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:36,716 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:36,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:36,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:36,925 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2023-02-17 08:14:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:36,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590206885] [2023-02-17 08:14:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:14:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:36,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590206885] [2023-02-17 08:14:36,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590206885] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:36,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732518718] [2023-02-17 08:14:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:36,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:37,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 08:14:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:37,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:14:37,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:14:37,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:14:37,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732518718] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:37,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:37,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-02-17 08:14:37,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880325140] [2023-02-17 08:14:37,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:37,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:14:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:14:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:14:37,146 INFO L87 Difference]: Start difference. First operand 2177 states and 3170 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-17 08:14:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:37,230 INFO L93 Difference]: Finished difference Result 1889 states and 2651 transitions. [2023-02-17 08:14:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:14:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 27 [2023-02-17 08:14:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:37,237 INFO L225 Difference]: With dead ends: 1889 [2023-02-17 08:14:37,237 INFO L226 Difference]: Without dead ends: 1889 [2023-02-17 08:14:37,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:14:37,239 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 455 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:37,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 553 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2023-02-17 08:14:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 831. [2023-02-17 08:14:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 819 states have (on average 1.468864468864469) internal successors, (1203), 830 states have internal predecessors, (1203), 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-17 08:14:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1203 transitions. [2023-02-17 08:14:37,259 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1203 transitions. Word has length 27 [2023-02-17 08:14:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:37,260 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1203 transitions. [2023-02-17 08:14:37,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-17 08:14:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1203 transitions. [2023-02-17 08:14:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 08:14:37,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:37,263 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:37,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:37,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-17 08:14:37,469 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:37,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2023-02-17 08:14:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:37,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151351446] [2023-02-17 08:14:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-17 08:14:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151351446] [2023-02-17 08:14:37,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151351446] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782047970] [2023-02-17 08:14:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:37,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:37,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:37,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 08:14:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:37,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:14:37,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:37,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:37,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782047970] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:37,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:37,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2023-02-17 08:14:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630295528] [2023-02-17 08:14:37,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:37,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:14:37,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:14:37,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:14:37,787 INFO L87 Difference]: Start difference. First operand 831 states and 1203 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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-17 08:14:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:37,990 INFO L93 Difference]: Finished difference Result 3249 states and 4495 transitions. [2023-02-17 08:14:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 08:14:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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 51 [2023-02-17 08:14:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:38,001 INFO L225 Difference]: With dead ends: 3249 [2023-02-17 08:14:38,002 INFO L226 Difference]: Without dead ends: 3249 [2023-02-17 08:14:38,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2023-02-17 08:14:38,003 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1387 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:38,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 888 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2023-02-17 08:14:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 1101. [2023-02-17 08:14:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1089 states have (on average 1.45821854912764) internal successors, (1588), 1100 states have internal predecessors, (1588), 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-17 08:14:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1588 transitions. [2023-02-17 08:14:38,032 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1588 transitions. Word has length 51 [2023-02-17 08:14:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:38,033 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1588 transitions. [2023-02-17 08:14:38,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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-17 08:14:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1588 transitions. [2023-02-17 08:14:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 08:14:38,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:38,034 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:38,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:38,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-17 08:14:38,241 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2023-02-17 08:14:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:38,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393794645] [2023-02-17 08:14:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-17 08:14:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:38,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393794645] [2023-02-17 08:14:38,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393794645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:38,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583837555] [2023-02-17 08:14:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:38,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:38,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:38,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:38,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 08:14:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:38,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:14:38,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 08:14:38,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 08:14:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583837555] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:38,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:38,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2023-02-17 08:14:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259989874] [2023-02-17 08:14:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:38,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:14:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:38,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:14:38,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:14:38,541 INFO L87 Difference]: Start difference. First operand 1101 states and 1588 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-17 08:14:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:38,619 INFO L93 Difference]: Finished difference Result 2427 states and 3410 transitions. [2023-02-17 08:14:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:14:38,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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) Word has length 59 [2023-02-17 08:14:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:38,627 INFO L225 Difference]: With dead ends: 2427 [2023-02-17 08:14:38,627 INFO L226 Difference]: Without dead ends: 2427 [2023-02-17 08:14:38,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:14:38,628 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 250 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:38,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 489 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2023-02-17 08:14:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1749. [2023-02-17 08:14:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1737 states have (on average 1.4352331606217616) internal successors, (2493), 1748 states have internal predecessors, (2493), 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-17 08:14:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2493 transitions. [2023-02-17 08:14:38,660 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2493 transitions. Word has length 59 [2023-02-17 08:14:38,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:38,660 INFO L495 AbstractCegarLoop]: Abstraction has 1749 states and 2493 transitions. [2023-02-17 08:14:38,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-17 08:14:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2493 transitions. [2023-02-17 08:14:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 08:14:38,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:38,662 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:38,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:38,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 08:14:38,869 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2023-02-17 08:14:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:38,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433800695] [2023-02-17 08:14:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 08:14:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433800695] [2023-02-17 08:14:38,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433800695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585231033] [2023-02-17 08:14:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:38,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:38,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 08:14:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:39,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:14:39,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-17 08:14:39,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-17 08:14:39,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585231033] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:39,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:39,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2023-02-17 08:14:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597692378] [2023-02-17 08:14:39,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:14:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:14:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:14:39,141 INFO L87 Difference]: Start difference. First operand 1749 states and 2493 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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-17 08:14:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:40,094 INFO L93 Difference]: Finished difference Result 9755 states and 13739 transitions. [2023-02-17 08:14:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-17 08:14:40,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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 59 [2023-02-17 08:14:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:40,127 INFO L225 Difference]: With dead ends: 9755 [2023-02-17 08:14:40,127 INFO L226 Difference]: Without dead ends: 9755 [2023-02-17 08:14:40,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2023-02-17 08:14:40,129 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1015 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:40,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 902 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 08:14:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9755 states. [2023-02-17 08:14:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9755 to 4918. [2023-02-17 08:14:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4918 states, 4907 states have (on average 1.4634196046464234) internal successors, (7181), 4917 states have internal predecessors, (7181), 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-17 08:14:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 7181 transitions. [2023-02-17 08:14:40,268 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 7181 transitions. Word has length 59 [2023-02-17 08:14:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:40,268 INFO L495 AbstractCegarLoop]: Abstraction has 4918 states and 7181 transitions. [2023-02-17 08:14:40,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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-17 08:14:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 7181 transitions. [2023-02-17 08:14:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-17 08:14:40,270 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:40,271 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:40,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:40,477 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2023-02-17 08:14:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249890138] [2023-02-17 08:14:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-17 08:14:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:40,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249890138] [2023-02-17 08:14:40,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249890138] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:40,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986975332] [2023-02-17 08:14:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:40,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:40,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 08:14:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:14:40,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:14:40,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:14:40,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986975332] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:40,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:40,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2023-02-17 08:14:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610828787] [2023-02-17 08:14:40,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:40,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:14:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:40,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:14:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:14:40,811 INFO L87 Difference]: Start difference. First operand 4918 states and 7181 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-17 08:14:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:41,183 INFO L93 Difference]: Finished difference Result 10540 states and 15062 transitions. [2023-02-17 08:14:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 08:14:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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 63 [2023-02-17 08:14:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:41,205 INFO L225 Difference]: With dead ends: 10540 [2023-02-17 08:14:41,206 INFO L226 Difference]: Without dead ends: 10540 [2023-02-17 08:14:41,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 08:14:41,207 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 967 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:41,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1571 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:14:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2023-02-17 08:14:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 4718. [2023-02-17 08:14:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 4707 states have (on average 1.4418950499256427) internal successors, (6787), 4717 states have internal predecessors, (6787), 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-17 08:14:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 6787 transitions. [2023-02-17 08:14:41,345 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 6787 transitions. Word has length 63 [2023-02-17 08:14:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:41,346 INFO L495 AbstractCegarLoop]: Abstraction has 4718 states and 6787 transitions. [2023-02-17 08:14:41,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-17 08:14:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6787 transitions. [2023-02-17 08:14:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-17 08:14:41,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:41,348 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:41,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-17 08:14:41,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:41,554 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2023-02-17 08:14:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:41,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247409113] [2023-02-17 08:14:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 08:14:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:14:41,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247409113] [2023-02-17 08:14:41,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247409113] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:14:41,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596918861] [2023-02-17 08:14:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:41,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:14:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 08:14:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:41,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:14:41,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 08:14:41,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 08:14:41,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596918861] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:41,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:14:41,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-02-17 08:14:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113729595] [2023-02-17 08:14:41,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:41,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:14:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:14:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:14:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:14:41,840 INFO L87 Difference]: Start difference. First operand 4718 states and 6787 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:42,036 INFO L93 Difference]: Finished difference Result 3827 states and 5204 transitions. [2023-02-17 08:14:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 08:14:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-17 08:14:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:42,042 INFO L225 Difference]: With dead ends: 3827 [2023-02-17 08:14:42,042 INFO L226 Difference]: Without dead ends: 3827 [2023-02-17 08:14:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2023-02-17 08:14:42,043 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 794 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:42,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1651 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2023-02-17 08:14:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2023-02-17 08:14:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3587946741415557) internal successors, (3878), 2864 states have internal predecessors, (3878), 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-17 08:14:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3878 transitions. [2023-02-17 08:14:42,117 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3878 transitions. Word has length 63 [2023-02-17 08:14:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:42,117 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3878 transitions. [2023-02-17 08:14:42,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3878 transitions. [2023-02-17 08:14:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 08:14:42,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:42,119 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:42,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:42,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:14:42,326 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2023-02-17 08:14:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:14:42,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001935295] [2023-02-17 08:14:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:14:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:14:42,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 08:14:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:14:42,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 08:14:42,376 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 08:14:42,377 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-02-17 08:14:42,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-02-17 08:14:42,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-02-17 08:14:42,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-02-17 08:14:42,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-02-17 08:14:42,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-02-17 08:14:42,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-02-17 08:14:42,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-02-17 08:14:42,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-02-17 08:14:42,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-02-17 08:14:42,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-02-17 08:14:42,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-02-17 08:14:42,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-02-17 08:14:42,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-02-17 08:14:42,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-02-17 08:14:42,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-02-17 08:14:42,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-02-17 08:14:42,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-02-17 08:14:42,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-02-17 08:14:42,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-02-17 08:14:42,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-17 08:14:42,385 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:42,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 08:14:42,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 08:14:42 BoogieIcfgContainer [2023-02-17 08:14:42,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 08:14:42,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 08:14:42,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 08:14:42,443 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 08:14:42,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:14:33" (3/4) ... [2023-02-17 08:14:42,446 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 08:14:42,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 08:14:42,447 INFO L158 Benchmark]: Toolchain (without parser) took 9981.60ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 111.6MB in the beginning and 113.7MB in the end (delta: -2.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2023-02-17 08:14:42,448 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.0MB in the end (delta: 183.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:14:42,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.47ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 94.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-17 08:14:42,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.62ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 08:14:42,449 INFO L158 Benchmark]: Boogie Preprocessor took 57.04ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:14:42,449 INFO L158 Benchmark]: RCFGBuilder took 426.76ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 73.5MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-17 08:14:42,450 INFO L158 Benchmark]: TraceAbstraction took 8988.75ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 72.9MB in the beginning and 113.7MB in the end (delta: -40.9MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2023-02-17 08:14:42,450 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 207.6MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:14:42,453 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.17ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.0MB in the end (delta: 183.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.47ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 94.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.62ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.04ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 426.76ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 73.5MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8988.75ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 72.9MB in the beginning and 113.7MB in the end (delta: -40.9MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 207.6MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0: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: -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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6696 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6696 mSDsluCounter, 9583 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7169 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 2414 mSDtfsCounter, 2105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1060 GetRequests, 793 SyntacticMatches, 42 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4918occurred in iteration=18, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 18734 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 4032 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1797 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 1459/1809 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-17 08:14:42,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:14:44,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:14:44,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:14:44,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:14:44,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:14:44,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:14:44,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:14:44,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:14:44,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:14:44,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:14:44,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:14:44,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:14:44,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:14:44,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:14:44,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:14:44,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:14:44,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:14:44,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:14:44,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:14:44,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:14:44,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:14:44,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:14:44,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:14:44,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:14:44,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:14:44,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:14:44,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:14:44,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:14:44,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:14:44,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:14:44,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:14:44,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:14:44,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:14:44,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:14:44,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:14:44,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:14:44,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:14:44,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:14:44,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:14:44,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:14:44,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:14:44,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:14:44,737 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:14:44,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:14:44,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:14:44,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:14:44,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:14:44,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:14:44,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:14:44,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:14:44,740 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:14:44,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:14:44,741 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:14:44,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:14:44,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:14:44,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:14:44,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:14:44,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:14:44,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:14:44,742 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:14:44,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:14:44,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:14:44,743 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:14:44,743 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:14:44,743 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:14:44,744 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:14:44,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:14:44,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:14:44,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:14:44,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:14:44,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:14:44,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:14:44,745 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:14:44,745 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:14:44,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:14:44,745 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:14:44,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:14:44,746 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:14:44,746 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:14:44,746 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2023-02-17 08:14:45,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:14:45,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:14:45,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:14:45,047 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:14:45,048 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:14:45,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-17 08:14:46,326 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:14:46,575 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:14:46,575 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-17 08:14:46,592 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407b36324/380a7a8a11b34972a7d70a9817804217/FLAG7b14fa723 [2023-02-17 08:14:46,611 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407b36324/380a7a8a11b34972a7d70a9817804217 [2023-02-17 08:14:46,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:14:46,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:14:46,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:14:46,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:14:46,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:14:46,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:14:46" (1/1) ... [2023-02-17 08:14:46,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682a1a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:46, skipping insertion in model container [2023-02-17 08:14:46,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:14:46" (1/1) ... [2023-02-17 08:14:46,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:14:46,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:14:46,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:14:46,998 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:14:47,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:14:47,089 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:14:47,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47 WrapperNode [2023-02-17 08:14:47,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:14:47,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:14:47,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:14:47,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:14:47,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,137 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2023-02-17 08:14:47,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:14:47,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:14:47,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:14:47,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:14:47,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:14:47,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:14:47,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:14:47,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:14:47,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (1/1) ... [2023-02-17 08:14:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:14:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:14:47,214 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-17 08:14:47,228 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-17 08:14:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 08:14:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 08:14:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:14:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:14:47,422 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:14:47,424 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:14:47,732 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:14:47,737 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:14:47,740 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 08:14:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:14:47 BoogieIcfgContainer [2023-02-17 08:14:47,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:14:47,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:14:47,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:14:47,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:14:47,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:14:46" (1/3) ... [2023-02-17 08:14:47,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a017322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:14:47, skipping insertion in model container [2023-02-17 08:14:47,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:14:47" (2/3) ... [2023-02-17 08:14:47,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a017322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:14:47, skipping insertion in model container [2023-02-17 08:14:47,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:14:47" (3/3) ... [2023-02-17 08:14:47,749 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2023-02-17 08:14:47,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:14:47,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-17 08:14:47,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:14:47,816 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;@4779a485, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:14:47,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-17 08:14:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 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-17 08:14:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:14:47,825 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:47,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:14:47,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2023-02-17 08:14:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:47,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213807861] [2023-02-17 08:14:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:47,843 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-17 08:14:47,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:47,849 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-17 08:14:47,890 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-17 08:14:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:47,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:14:47,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:47,983 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-17 08:14:47,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:14:47,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213807861] [2023-02-17 08:14:47,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213807861] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:47,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:47,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141218319] [2023-02-17 08:14:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:47,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:48,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:48,019 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:48,078 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2023-02-17 08:14:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 08:14:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:48,098 INFO L225 Difference]: With dead ends: 107 [2023-02-17 08:14:48,098 INFO L226 Difference]: Without dead ends: 105 [2023-02-17 08:14:48,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:48,117 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:48,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-17 08:14:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2023-02-17 08:14:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 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-17 08:14:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2023-02-17 08:14:48,176 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2023-02-17 08:14:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:48,176 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2023-02-17 08:14:48,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2023-02-17 08:14:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:14:48,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:48,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:14:48,191 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-17 08:14:48,387 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-17 08:14:48,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2023-02-17 08:14:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403441768] [2023-02-17 08:14:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:48,390 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-17 08:14:48,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:48,392 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-17 08:14:48,395 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-17 08:14:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:48,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 08:14:48,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:48,464 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-17 08:14:48,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:14:48,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:48,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403441768] [2023-02-17 08:14:48,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403441768] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:48,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:48,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480254803] [2023-02-17 08:14:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:48,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:48,474 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:48,589 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2023-02-17 08:14:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 08:14:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:48,592 INFO L225 Difference]: With dead ends: 163 [2023-02-17 08:14:48,592 INFO L226 Difference]: Without dead ends: 160 [2023-02-17 08:14:48,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 08:14:48,593 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:48,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-17 08:14:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2023-02-17 08:14:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 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-17 08:14:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2023-02-17 08:14:48,607 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2023-02-17 08:14:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:48,608 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2023-02-17 08:14:48,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2023-02-17 08:14:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:14:48,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:48,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:14:48,622 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 (3)] Ended with exit code 0 [2023-02-17 08:14:48,821 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-17 08:14:48,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2023-02-17 08:14:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163845379] [2023-02-17 08:14:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:48,823 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-17 08:14:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:48,824 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-17 08:14:48,827 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-17 08:14:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:48,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:14:48,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:48,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:14:48,899 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-17 08:14:48,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:14:48,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:48,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163845379] [2023-02-17 08:14:48,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163845379] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:48,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:48,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424054348] [2023-02-17 08:14:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:48,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:48,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:48,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:48,902 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:49,015 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2023-02-17 08:14:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 08:14:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:49,017 INFO L225 Difference]: With dead ends: 211 [2023-02-17 08:14:49,018 INFO L226 Difference]: Without dead ends: 211 [2023-02-17 08:14:49,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 08:14:49,019 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:49,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-17 08:14:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2023-02-17 08:14:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 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-17 08:14:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2023-02-17 08:14:49,031 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2023-02-17 08:14:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:49,031 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2023-02-17 08:14:49,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2023-02-17 08:14:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:14:49,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:49,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:14:49,048 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-17 08:14:49,241 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-17 08:14:49,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2023-02-17 08:14:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:49,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438000076] [2023-02-17 08:14:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:49,242 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-17 08:14:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:49,243 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-17 08:14:49,244 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-17 08:14:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:49,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:14:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:49,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:14:49,337 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-17 08:14:49,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:14:49,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438000076] [2023-02-17 08:14:49,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438000076] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:49,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:49,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:14:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474950263] [2023-02-17 08:14:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:49,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:14:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:14:49,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:14:49,348 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:49,483 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2023-02-17 08:14:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:14:49,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 08:14:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:49,485 INFO L225 Difference]: With dead ends: 206 [2023-02-17 08:14:49,485 INFO L226 Difference]: Without dead ends: 206 [2023-02-17 08:14:49,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 08:14:49,486 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:49,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-17 08:14:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2023-02-17 08:14:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 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-17 08:14:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2023-02-17 08:14:49,511 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2023-02-17 08:14:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:49,511 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2023-02-17 08:14:49,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2023-02-17 08:14:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 08:14:49,512 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:49,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:49,523 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-17 08:14:49,721 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-17 08:14:49,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2023-02-17 08:14:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:49,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291409694] [2023-02-17 08:14:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:49,725 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-17 08:14:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:49,727 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-17 08:14:49,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 08:14:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:49,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:14:49,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:49,823 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-17 08:14:49,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:14:49,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:49,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291409694] [2023-02-17 08:14:49,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291409694] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:49,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:49,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:14:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608865328] [2023-02-17 08:14:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:49,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:14:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:14:49,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:14:49,826 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-17 08:14:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:49,861 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2023-02-17 08:14:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:14:49,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-02-17 08:14:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:49,863 INFO L225 Difference]: With dead ends: 211 [2023-02-17 08:14:49,863 INFO L226 Difference]: Without dead ends: 211 [2023-02-17 08:14:49,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:49,864 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:49,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-17 08:14:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2023-02-17 08:14:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 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-17 08:14:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2023-02-17 08:14:49,871 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2023-02-17 08:14:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:49,871 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2023-02-17 08:14:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-17 08:14:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2023-02-17 08:14:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 08:14:49,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:49,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:49,883 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-17 08:14:50,080 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-17 08:14:50,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2023-02-17 08:14:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:50,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593072370] [2023-02-17 08:14:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:50,082 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-17 08:14:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:50,083 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-17 08:14:50,085 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-17 08:14:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:50,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:14:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:50,137 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-17 08:14:50,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:14:50,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593072370] [2023-02-17 08:14:50,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593072370] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:14:50,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:14:50,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:14:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989550023] [2023-02-17 08:14:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:14:50,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:14:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:14:50,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:14:50,142 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-17 08:14:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:50,188 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2023-02-17 08:14:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:14:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-17 08:14:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:50,190 INFO L225 Difference]: With dead ends: 283 [2023-02-17 08:14:50,190 INFO L226 Difference]: Without dead ends: 283 [2023-02-17 08:14:50,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:50,192 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:50,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-17 08:14:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2023-02-17 08:14:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 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-17 08:14:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2023-02-17 08:14:50,207 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2023-02-17 08:14:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:50,208 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2023-02-17 08:14:50,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-17 08:14:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2023-02-17 08:14:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:14:50,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:50,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:50,221 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-17 08:14:50,417 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-17 08:14:50,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2023-02-17 08:14:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:50,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483152365] [2023-02-17 08:14:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:50,419 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-17 08:14:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:50,420 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-17 08:14:50,422 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-17 08:14:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:50,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:14:50,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:50,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:50,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:50,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483152365] [2023-02-17 08:14:50,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483152365] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:50,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:50,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-17 08:14:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565884673] [2023-02-17 08:14:50,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:14:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:50,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:14:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:14:50,506 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:50,583 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2023-02-17 08:14:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:14:50,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:14:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:50,586 INFO L225 Difference]: With dead ends: 461 [2023-02-17 08:14:50,586 INFO L226 Difference]: Without dead ends: 461 [2023-02-17 08:14:50,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:14:50,587 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:50,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 471 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-02-17 08:14:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 258. [2023-02-17 08:14:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 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-17 08:14:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2023-02-17 08:14:50,595 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 12 [2023-02-17 08:14:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:50,595 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2023-02-17 08:14:50,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2023-02-17 08:14:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:14:50,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:50,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:50,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:50,811 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-17 08:14:50,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2023-02-17 08:14:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:50,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055975124] [2023-02-17 08:14:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:50,813 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-17 08:14:50,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:50,814 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-17 08:14:50,815 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-17 08:14:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:50,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:14:50,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:50,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:50,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055975124] [2023-02-17 08:14:50,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055975124] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:50,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:50,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-02-17 08:14:50,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427961571] [2023-02-17 08:14:50,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:50,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:14:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:14:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:14:50,908 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-17 08:14:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:50,951 INFO L93 Difference]: Finished difference Result 600 states and 886 transitions. [2023-02-17 08:14:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:14:50,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:14:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:50,954 INFO L225 Difference]: With dead ends: 600 [2023-02-17 08:14:50,955 INFO L226 Difference]: Without dead ends: 600 [2023-02-17 08:14:50,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-17 08:14:50,955 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 210 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:50,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 343 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-02-17 08:14:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2023-02-17 08:14:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.570921985815603) internal successors, (886), 575 states have internal predecessors, (886), 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-17 08:14:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2023-02-17 08:14:50,973 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 12 [2023-02-17 08:14:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:50,973 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2023-02-17 08:14:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-17 08:14:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2023-02-17 08:14:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:14:50,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:50,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:50,988 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-17 08:14:51,185 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-17 08:14:51,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2023-02-17 08:14:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:51,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898314710] [2023-02-17 08:14:51,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:14:51,186 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-17 08:14:51,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:51,187 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-17 08:14:51,188 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-17 08:14:51,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:14:51,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:14:51,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:14:51,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:14:51,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:14:51,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:51,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898314710] [2023-02-17 08:14:51,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898314710] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:51,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:51,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-17 08:14:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773382584] [2023-02-17 08:14:51,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:51,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:14:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:14:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:14:51,307 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:51,446 INFO L93 Difference]: Finished difference Result 1048 states and 1542 transitions. [2023-02-17 08:14:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:14:51,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 08:14:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:51,450 INFO L225 Difference]: With dead ends: 1048 [2023-02-17 08:14:51,450 INFO L226 Difference]: Without dead ends: 1048 [2023-02-17 08:14:51,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-17 08:14:51,453 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 233 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:51,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 621 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-02-17 08:14:51,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 760. [2023-02-17 08:14:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 748 states have (on average 1.5026737967914439) internal successors, (1124), 759 states have internal predecessors, (1124), 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-17 08:14:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1124 transitions. [2023-02-17 08:14:51,471 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1124 transitions. Word has length 16 [2023-02-17 08:14:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:51,471 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1124 transitions. [2023-02-17 08:14:51,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1124 transitions. [2023-02-17 08:14:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:14:51,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:51,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:51,485 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-17 08:14:51,682 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-17 08:14:51,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2023-02-17 08:14:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976650010] [2023-02-17 08:14:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:51,684 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-17 08:14:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:51,685 INFO L229 MonitoredProcess]: Starting monitored process 11 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-17 08:14:51,689 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 (11)] Waiting until timeout for monitored process [2023-02-17 08:14:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:51,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 08:14:51,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:51,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:51,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:51,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976650010] [2023-02-17 08:14:51,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976650010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:51,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:51,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-17 08:14:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362815412] [2023-02-17 08:14:51,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:51,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:14:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:14:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:14:51,747 INFO L87 Difference]: Start difference. First operand 760 states and 1124 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-17 08:14:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:51,805 INFO L93 Difference]: Finished difference Result 1055 states and 1524 transitions. [2023-02-17 08:14:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:14:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2023-02-17 08:14:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:51,810 INFO L225 Difference]: With dead ends: 1055 [2023-02-17 08:14:51,810 INFO L226 Difference]: Without dead ends: 1055 [2023-02-17 08:14:51,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:14:51,811 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:51,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 192 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2023-02-17 08:14:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 912. [2023-02-17 08:14:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 900 states have (on average 1.471111111111111) internal successors, (1324), 911 states have internal predecessors, (1324), 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-17 08:14:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1324 transitions. [2023-02-17 08:14:51,833 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1324 transitions. Word has length 18 [2023-02-17 08:14:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:51,834 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1324 transitions. [2023-02-17 08:14:51,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-17 08:14:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1324 transitions. [2023-02-17 08:14:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:14:51,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:51,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:51,845 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 (11)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:52,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-17 08:14:52,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2023-02-17 08:14:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:52,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956568489] [2023-02-17 08:14:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:52,045 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-17 08:14:52,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:52,047 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 08:14:52,047 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 (12)] Waiting until timeout for monitored process [2023-02-17 08:14:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:52,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:14:52,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:52,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:52,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:52,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956568489] [2023-02-17 08:14:52,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956568489] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:52,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:52,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-17 08:14:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028224654] [2023-02-17 08:14:52,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:52,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:14:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:52,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:14:52,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:14:52,139 INFO L87 Difference]: Start difference. First operand 912 states and 1324 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-17 08:14:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:52,208 INFO L93 Difference]: Finished difference Result 1144 states and 1576 transitions. [2023-02-17 08:14:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:14:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2023-02-17 08:14:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:52,213 INFO L225 Difference]: With dead ends: 1144 [2023-02-17 08:14:52,213 INFO L226 Difference]: Without dead ends: 1144 [2023-02-17 08:14:52,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:14:52,214 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:52,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2023-02-17 08:14:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 835. [2023-02-17 08:14:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 823 states have (on average 1.4349939246658565) internal successors, (1181), 834 states have internal predecessors, (1181), 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-17 08:14:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1181 transitions. [2023-02-17 08:14:52,231 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1181 transitions. Word has length 21 [2023-02-17 08:14:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:52,231 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1181 transitions. [2023-02-17 08:14:52,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-17 08:14:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1181 transitions. [2023-02-17 08:14:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:14:52,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:52,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:52,249 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 (12)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:52,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-17 08:14:52,450 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2023-02-17 08:14:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:52,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693397684] [2023-02-17 08:14:52,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:14:52,451 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-17 08:14:52,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:52,453 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 08:14:52,454 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 (13)] Waiting until timeout for monitored process [2023-02-17 08:14:52,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:14:52,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:14:52,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:14:52,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:14:52,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:14:52,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:52,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693397684] [2023-02-17 08:14:52,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693397684] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:52,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:52,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-17 08:14:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151716216] [2023-02-17 08:14:52,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:52,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:14:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:14:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:14:52,577 INFO L87 Difference]: Start difference. First operand 835 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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-17 08:14:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:52,636 INFO L93 Difference]: Finished difference Result 826 states and 1126 transitions. [2023-02-17 08:14:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:14:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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) Word has length 27 [2023-02-17 08:14:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:52,640 INFO L225 Difference]: With dead ends: 826 [2023-02-17 08:14:52,640 INFO L226 Difference]: Without dead ends: 826 [2023-02-17 08:14:52,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:14:52,641 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 216 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:52,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 488 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:14:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-02-17 08:14:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 802. [2023-02-17 08:14:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 790 states have (on average 1.4253164556962026) internal successors, (1126), 801 states have internal predecessors, (1126), 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-17 08:14:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1126 transitions. [2023-02-17 08:14:52,655 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1126 transitions. Word has length 27 [2023-02-17 08:14:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:52,655 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1126 transitions. [2023-02-17 08:14:52,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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-17 08:14:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1126 transitions. [2023-02-17 08:14:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:14:52,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:52,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:52,671 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 (13)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:52,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-17 08:14:52,866 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2023-02-17 08:14:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:52,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606799719] [2023-02-17 08:14:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:52,867 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-17 08:14:52,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:52,868 INFO L229 MonitoredProcess]: Starting monitored process 14 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-17 08:14:52,869 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 (14)] Waiting until timeout for monitored process [2023-02-17 08:14:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:52,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:14:52,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:52,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:52,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:52,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606799719] [2023-02-17 08:14:52,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606799719] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:52,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:52,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-17 08:14:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635843277] [2023-02-17 08:14:52,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:52,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:14:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:52,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:14:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:14:52,982 INFO L87 Difference]: Start difference. First operand 802 states and 1126 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-17 08:14:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:53,064 INFO L93 Difference]: Finished difference Result 871 states and 1150 transitions. [2023-02-17 08:14:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:14:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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) Word has length 27 [2023-02-17 08:14:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:53,068 INFO L225 Difference]: With dead ends: 871 [2023-02-17 08:14:53,068 INFO L226 Difference]: Without dead ends: 871 [2023-02-17 08:14:53,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:14:53,069 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:53,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-17 08:14:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 736. [2023-02-17 08:14:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 724 states have (on average 1.388121546961326) internal successors, (1005), 735 states have internal predecessors, (1005), 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-17 08:14:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1005 transitions. [2023-02-17 08:14:53,088 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1005 transitions. Word has length 27 [2023-02-17 08:14:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:53,089 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1005 transitions. [2023-02-17 08:14:53,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-17 08:14:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1005 transitions. [2023-02-17 08:14:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 08:14:53,091 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:53,091 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:53,105 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 (14)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:53,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-17 08:14:53,301 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2023-02-17 08:14:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:53,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609796645] [2023-02-17 08:14:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:53,302 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-17 08:14:53,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:53,303 INFO L229 MonitoredProcess]: Starting monitored process 15 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-17 08:14:53,304 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 (15)] Waiting until timeout for monitored process [2023-02-17 08:14:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:53,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:14:53,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:53,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:53,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:53,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609796645] [2023-02-17 08:14:53,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609796645] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:53,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:53,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-02-17 08:14:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878532049] [2023-02-17 08:14:53,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:53,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:14:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:14:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:14:53,520 INFO L87 Difference]: Start difference. First operand 736 states and 1005 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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-17 08:14:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:53,826 INFO L93 Difference]: Finished difference Result 1562 states and 2099 transitions. [2023-02-17 08:14:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 08:14:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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 30 [2023-02-17 08:14:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:53,831 INFO L225 Difference]: With dead ends: 1562 [2023-02-17 08:14:53,832 INFO L226 Difference]: Without dead ends: 1562 [2023-02-17 08:14:53,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2023-02-17 08:14:53,833 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 670 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:53,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1291 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2023-02-17 08:14:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1514. [2023-02-17 08:14:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1502 states have (on average 1.3974700399467377) internal successors, (2099), 1513 states have internal predecessors, (2099), 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-17 08:14:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2099 transitions. [2023-02-17 08:14:53,858 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2099 transitions. Word has length 30 [2023-02-17 08:14:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:53,858 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2099 transitions. [2023-02-17 08:14:53,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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-17 08:14:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2099 transitions. [2023-02-17 08:14:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 08:14:53,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:53,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:53,869 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 (15)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:54,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-17 08:14:54,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2023-02-17 08:14:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:54,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555297114] [2023-02-17 08:14:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:54,070 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-17 08:14:54,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:54,071 INFO L229 MonitoredProcess]: Starting monitored process 16 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-17 08:14:54,072 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 (16)] Waiting until timeout for monitored process [2023-02-17 08:14:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:54,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:14:54,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:54,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:54,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:54,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555297114] [2023-02-17 08:14:54,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555297114] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:54,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:54,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-17 08:14:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618737823] [2023-02-17 08:14:54,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:54,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:14:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:14:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:14:54,205 INFO L87 Difference]: Start difference. First operand 1514 states and 2099 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:54,316 INFO L93 Difference]: Finished difference Result 1881 states and 2531 transitions. [2023-02-17 08:14:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:14:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-17 08:14:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:54,323 INFO L225 Difference]: With dead ends: 1881 [2023-02-17 08:14:54,323 INFO L226 Difference]: Without dead ends: 1881 [2023-02-17 08:14:54,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:14:54,324 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:54,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2023-02-17 08:14:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1470. [2023-02-17 08:14:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1458 states have (on average 1.379286694101509) internal successors, (2011), 1469 states have internal predecessors, (2011), 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-17 08:14:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 2011 transitions. [2023-02-17 08:14:54,351 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 2011 transitions. Word has length 33 [2023-02-17 08:14:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:54,351 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 2011 transitions. [2023-02-17 08:14:54,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:14:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 2011 transitions. [2023-02-17 08:14:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 08:14:54,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:54,352 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:54,361 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 (16)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:54,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-17 08:14:54,562 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2023-02-17 08:14:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:54,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898699411] [2023-02-17 08:14:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:54,563 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-17 08:14:54,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:54,565 INFO L229 MonitoredProcess]: Starting monitored process 17 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-17 08:14:54,568 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 (17)] Waiting until timeout for monitored process [2023-02-17 08:14:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:14:54,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:14:54,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:54,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:54,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:54,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898699411] [2023-02-17 08:14:54,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898699411] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:54,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:54,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-17 08:14:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008820346] [2023-02-17 08:14:54,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:54,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:14:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:14:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:14:54,726 INFO L87 Difference]: Start difference. First operand 1470 states and 2011 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-17 08:14:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:54,894 INFO L93 Difference]: Finished difference Result 1871 states and 2487 transitions. [2023-02-17 08:14:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 08:14:54,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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 41 [2023-02-17 08:14:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:54,901 INFO L225 Difference]: With dead ends: 1871 [2023-02-17 08:14:54,902 INFO L226 Difference]: Without dead ends: 1871 [2023-02-17 08:14:54,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-17 08:14:54,903 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:54,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:14:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2023-02-17 08:14:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1448. [2023-02-17 08:14:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1436 states have (on average 1.3697771587743732) internal successors, (1967), 1447 states have internal predecessors, (1967), 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-17 08:14:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1967 transitions. [2023-02-17 08:14:54,928 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1967 transitions. Word has length 41 [2023-02-17 08:14:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:54,929 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1967 transitions. [2023-02-17 08:14:54,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-17 08:14:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1967 transitions. [2023-02-17 08:14:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 08:14:54,930 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:54,931 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:54,940 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 (17)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-17 08:14:55,141 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2023-02-17 08:14:55,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:55,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081858576] [2023-02-17 08:14:55,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:14:55,142 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-17 08:14:55,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:55,143 INFO L229 MonitoredProcess]: Starting monitored process 18 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-17 08:14:55,147 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 (18)] Waiting until timeout for monitored process [2023-02-17 08:14:55,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:14:55,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:14:55,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:14:55,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:14:55,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:14:55,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081858576] [2023-02-17 08:14:55,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081858576] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:55,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:55,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2023-02-17 08:14:55,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954837521] [2023-02-17 08:14:55,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:55,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 08:14:55,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 08:14:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:14:55,467 INFO L87 Difference]: Start difference. First operand 1448 states and 1967 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 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-17 08:14:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:55,898 INFO L93 Difference]: Finished difference Result 1662 states and 2170 transitions. [2023-02-17 08:14:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-17 08:14:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 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 49 [2023-02-17 08:14:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:55,903 INFO L225 Difference]: With dead ends: 1662 [2023-02-17 08:14:55,904 INFO L226 Difference]: Without dead ends: 1662 [2023-02-17 08:14:55,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 08:14:55,905 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 763 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:55,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 2047 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:14:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2023-02-17 08:14:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1602. [2023-02-17 08:14:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1590 states have (on average 1.3647798742138364) internal successors, (2170), 1601 states have internal predecessors, (2170), 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-17 08:14:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2170 transitions. [2023-02-17 08:14:55,942 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2170 transitions. Word has length 49 [2023-02-17 08:14:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:55,942 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2170 transitions. [2023-02-17 08:14:55,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 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-17 08:14:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2170 transitions. [2023-02-17 08:14:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 08:14:55,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:55,944 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:55,957 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 (18)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:56,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-17 08:14:56,154 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-17 08:14:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2023-02-17 08:14:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562892656] [2023-02-17 08:14:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:14:56,155 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-17 08:14:56,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:56,157 INFO L229 MonitoredProcess]: Starting monitored process 19 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-17 08:14:56,160 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 (19)] Waiting until timeout for monitored process [2023-02-17 08:14:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:14:56,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 08:14:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:14:56,378 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-17 08:14:56,379 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 08:14:56,379 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-02-17 08:14:56,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-02-17 08:14:56,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-02-17 08:14:56,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-02-17 08:14:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-02-17 08:14:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-02-17 08:14:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-02-17 08:14:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-02-17 08:14:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-02-17 08:14:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-02-17 08:14:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-02-17 08:14:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-02-17 08:14:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-02-17 08:14:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-02-17 08:14:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-02-17 08:14:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-02-17 08:14:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-02-17 08:14:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-02-17 08:14:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-02-17 08:14:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-02-17 08:14:56,412 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 (19)] Forceful destruction successful, exit code 0 [2023-02-17 08:14:56,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-17 08:14:56,597 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:56,600 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 08:14:56,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 08:14:56 BoogieIcfgContainer [2023-02-17 08:14:56,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 08:14:56,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 08:14:56,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 08:14:56,647 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 08:14:56,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:14:47" (3/4) ... [2023-02-17 08:14:56,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 08:14:56,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 08:14:56,650 INFO L158 Benchmark]: Toolchain (without parser) took 10034.18ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 49.2MB in the beginning and 62.6MB in the end (delta: -13.3MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2023-02-17 08:14:56,650 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:14:56,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.94ms. Allocated memory is still 75.5MB. Free memory was 49.0MB in the beginning and 49.2MB in the end (delta: -169.3kB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2023-02-17 08:14:56,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.08ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 08:14:56,651 INFO L158 Benchmark]: Boogie Preprocessor took 34.54ms. Allocated memory is still 75.5MB. Free memory was 46.8MB in the beginning and 45.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:14:56,651 INFO L158 Benchmark]: RCFGBuilder took 565.76ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 46.7MB in the end (delta: -1.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-02-17 08:14:56,652 INFO L158 Benchmark]: TraceAbstraction took 8902.41ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 46.0MB in the beginning and 62.6MB in the end (delta: -16.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-02-17 08:14:56,652 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 117.4MB. Free memory was 62.6MB in the beginning and 62.6MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:14:56,653 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.94ms. Allocated memory is still 75.5MB. Free memory was 49.0MB in the beginning and 49.2MB in the end (delta: -169.3kB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.08ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.54ms. Allocated memory is still 75.5MB. Free memory was 46.8MB in the beginning and 45.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 565.76ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 46.7MB in the end (delta: -1.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8902.41ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 46.0MB in the beginning and 62.6MB in the end (delta: -16.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 117.4MB. Free memory was 62.6MB in the beginning and 62.6MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0: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: -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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3906 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3906 mSDsluCounter, 10507 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8086 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 2421 mSDtfsCounter, 1237 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 487 SyntacticMatches, 19 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1602occurred in iteration=17, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2297 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 4625 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1510 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 204/538 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-17 08:14:56,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample