./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 07:06:37,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:06:37,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:06:37,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:06:37,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:06:37,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:06:37,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:06:37,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:06:37,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:06:37,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:06:37,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:06:37,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:06:37,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:06:37,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:06:37,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:06:37,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:06:37,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:06:37,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:06:37,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:06:37,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:06:37,246 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:06:37,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:06:37,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:06:37,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:06:37,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:06:37,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:06:37,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:06:37,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:06:37,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:06:37,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:06:37,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:06:37,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:06:37,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:06:37,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:06:37,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:06:37,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:06:37,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:06:37,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:06:37,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:06:37,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:06:37,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:06:37,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:06:37,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 07:06:37,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:06:37,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:06:37,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:06:37,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:06:37,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:06:37,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:06:37,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:06:37,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:06:37,297 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:06:37,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:06:37,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:06:37,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:06:37,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:06:37,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:06:37,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:06:37,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:06:37,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:06:37,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:06:37,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:06:37,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:37,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:06:37,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:06:37,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:06:37,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:06:37,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2022-07-14 07:06:37,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:06:37,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:06:37,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:06:37,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:06:37,496 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:06:37,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2022-07-14 07:06:37,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61443443a/08f3304a6ced4c56b90c08307328b5cb/FLAG4428e10e8 [2022-07-14 07:06:37,853 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:06:37,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2022-07-14 07:06:37,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61443443a/08f3304a6ced4c56b90c08307328b5cb/FLAG4428e10e8 [2022-07-14 07:06:38,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61443443a/08f3304a6ced4c56b90c08307328b5cb [2022-07-14 07:06:38,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:06:38,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:06:38,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:38,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:06:38,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:06:38,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d7edc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38, skipping insertion in model container [2022-07-14 07:06:38,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:06:38,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:06:38,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:38,435 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:06:38,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:38,455 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:06:38,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38 WrapperNode [2022-07-14 07:06:38,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:38,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:38,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:06:38,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:06:38,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,492 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2022-07-14 07:06:38,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:38,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:06:38,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:06:38,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:06:38,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:06:38,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:06:38,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:06:38,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:06:38,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (1/1) ... [2022-07-14 07:06:38,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:38,534 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) [2022-07-14 07:06:38,540 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 [2022-07-14 07:06:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:06:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 07:06:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 07:06:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 07:06:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:06:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:06:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 07:06:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 07:06:38,624 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:06:38,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:06:38,839 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:06:38,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:06:38,844 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-14 07:06:38,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:38 BoogieIcfgContainer [2022-07-14 07:06:38,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:06:38,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:06:38,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:06:38,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:06:38,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:06:38" (1/3) ... [2022-07-14 07:06:38,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98167d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:06:38, skipping insertion in model container [2022-07-14 07:06:38,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:38" (2/3) ... [2022-07-14 07:06:38,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98167d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:06:38, skipping insertion in model container [2022-07-14 07:06:38,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:38" (3/3) ... [2022-07-14 07:06:38,852 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2022-07-14 07:06:38,860 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:06:38,860 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-07-14 07:06:38,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:06:38,912 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fd61aef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e94977d [2022-07-14 07:06:38,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-14 07:06:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:06:38,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:38,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:06:38,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 07:06:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:38,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630893348] [2022-07-14 07:06:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:39,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630893348] [2022-07-14 07:06:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630893348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:39,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:39,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 07:06:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893364041] [2022-07-14 07:06:39,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:39,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:39,112 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:39,161 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-07-14 07:06:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-14 07:06:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:39,185 INFO L225 Difference]: With dead ends: 52 [2022-07-14 07:06:39,186 INFO L226 Difference]: Without dead ends: 50 [2022-07-14 07:06:39,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:39,189 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:39,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-14 07:06:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-14 07:06:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 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) [2022-07-14 07:06:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-07-14 07:06:39,222 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2022-07-14 07:06:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:39,222 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-07-14 07:06:39,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-07-14 07:06:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:06:39,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:39,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:06:39,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:06:39,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-07-14 07:06:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423931610] [2022-07-14 07:06:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:39,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423931610] [2022-07-14 07:06:39,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423931610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:39,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:39,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503859998] [2022-07-14 07:06:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:39,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:06:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:06:39,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:06:39,278 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:39,314 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-14 07:06:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:06:39,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-14 07:06:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:39,316 INFO L225 Difference]: With dead ends: 53 [2022-07-14 07:06:39,316 INFO L226 Difference]: Without dead ends: 53 [2022-07-14 07:06:39,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:06:39,317 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:39,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-14 07:06:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-07-14 07:06:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-07-14 07:06:39,321 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2022-07-14 07:06:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:39,322 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-07-14 07:06:39,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-07-14 07:06:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 07:06:39,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:39,323 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-07-14 07:06:39,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:06:39,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2022-07-14 07:06:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784772921] [2022-07-14 07:06:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784772921] [2022-07-14 07:06:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784772921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462538929] [2022-07-14 07:06:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:39,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:39,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:39,416 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) [2022-07-14 07:06:39,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 07:06:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:39,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 07:06:39,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:39,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462538929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:39,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:39,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-07-14 07:06:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025744093] [2022-07-14 07:06:39,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:39,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 07:06:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:39,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 07:06:39,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-14 07:06:39,576 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2022-07-14 07:06:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:39,762 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-07-14 07:06:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:06:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 7 [2022-07-14 07:06:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:39,763 INFO L225 Difference]: With dead ends: 59 [2022-07-14 07:06:39,763 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 07:06:39,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-07-14 07:06:39,764 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 179 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:39,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 126 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 07:06:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-14 07:06:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-07-14 07:06:39,769 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2022-07-14 07:06:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:39,769 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-07-14 07:06:39,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2022-07-14 07:06:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-07-14 07:06:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 07:06:39,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:39,770 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:39,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 07:06:39,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:39,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2022-07-14 07:06:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:39,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496544589] [2022-07-14 07:06:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:40,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496544589] [2022-07-14 07:06:40,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496544589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:40,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215003079] [2022-07-14 07:06:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:40,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:40,082 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) [2022-07-14 07:06:40,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 07:06:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:40,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 07:06:40,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:40,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:40,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215003079] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:40,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:40,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 07:06:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390633650] [2022-07-14 07:06:40,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:40,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 07:06:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 07:06:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:06:40,230 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:40,288 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-07-14 07:06:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 07:06:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 07:06:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:40,290 INFO L225 Difference]: With dead ends: 77 [2022-07-14 07:06:40,290 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 07:06:40,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:06:40,291 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:40,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 290 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 07:06:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-14 07:06:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 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) [2022-07-14 07:06:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-07-14 07:06:40,295 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2022-07-14 07:06:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:40,295 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-07-14 07:06:40,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-07-14 07:06:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 07:06:40,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:40,297 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:40,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:40,515 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,SelfDestructingSolverStorable3 [2022-07-14 07:06:40,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2022-07-14 07:06:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:40,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223564577] [2022-07-14 07:06:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:40,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223564577] [2022-07-14 07:06:40,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223564577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589249057] [2022-07-14 07:06:40,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:06:40,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:40,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:40,752 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) [2022-07-14 07:06:40,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 07:06:40,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 07:06:40,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:40,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 07:06:40,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:41,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:41,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589249057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:41,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 07:06:41,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 17 [2022-07-14 07:06:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087637304] [2022-07-14 07:06:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:06:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:06:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-07-14 07:06:41,003 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:41,087 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-07-14 07:06:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:06:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-14 07:06:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:41,089 INFO L225 Difference]: With dead ends: 85 [2022-07-14 07:06:41,089 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 07:06:41,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-07-14 07:06:41,090 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:41,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 64 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 07:06:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-07-14 07:06:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-07-14 07:06:41,095 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2022-07-14 07:06:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:41,095 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-07-14 07:06:41,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-07-14 07:06:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 07:06:41,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:41,097 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:41,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:41,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:41,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2022-07-14 07:06:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728716740] [2022-07-14 07:06:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-14 07:06:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728716740] [2022-07-14 07:06:41,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728716740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:41,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:41,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:06:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790467651] [2022-07-14 07:06:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:41,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:06:41,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:41,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:06:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:06:41,375 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.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) [2022-07-14 07:06:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:41,435 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-14 07:06:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:06:41,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.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 37 [2022-07-14 07:06:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:41,437 INFO L225 Difference]: With dead ends: 78 [2022-07-14 07:06:41,437 INFO L226 Difference]: Without dead ends: 78 [2022-07-14 07:06:41,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:06:41,438 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:41,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-14 07:06:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-14 07:06:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-14 07:06:41,453 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2022-07-14 07:06:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:41,453 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-14 07:06:41,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.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) [2022-07-14 07:06:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-14 07:06:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 07:06:41,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:41,454 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 07:06:41,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2022-07-14 07:06:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:41,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605451913] [2022-07-14 07:06:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:41,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:41,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605451913] [2022-07-14 07:06:41,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605451913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:41,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:41,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 07:06:41,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076520007] [2022-07-14 07:06:41,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:41,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:41,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:41,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:41,529 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:41,548 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-07-14 07:06:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 38 [2022-07-14 07:06:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:41,549 INFO L225 Difference]: With dead ends: 77 [2022-07-14 07:06:41,549 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 07:06:41,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:41,550 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:41,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 07:06:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-14 07:06:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 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) [2022-07-14 07:06:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-07-14 07:06:41,553 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 38 [2022-07-14 07:06:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:41,554 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-07-14 07:06:41,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-07-14 07:06:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 07:06:41,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:41,555 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:41,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 07:06:41,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2022-07-14 07:06:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:41,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029946129] [2022-07-14 07:06:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029946129] [2022-07-14 07:06:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029946129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:41,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:41,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21699644] [2022-07-14 07:06:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:41,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:06:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:41,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:06:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:06:41,626 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:41,658 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-14 07:06:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:06:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 38 [2022-07-14 07:06:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:41,659 INFO L225 Difference]: With dead ends: 80 [2022-07-14 07:06:41,659 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 07:06:41,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:06:41,660 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:41,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 07:06:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-07-14 07:06:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-14 07:06:41,663 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2022-07-14 07:06:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:41,664 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-14 07:06:41,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-14 07:06:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:06:41,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:41,665 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:41,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 07:06:41,665 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:41,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2022-07-14 07:06:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:41,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186363965] [2022-07-14 07:06:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 100 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:41,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186363965] [2022-07-14 07:06:41,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186363965] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520861281] [2022-07-14 07:06:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:41,888 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) [2022-07-14 07:06:41,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 07:06:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:41,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 07:06:41,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:42,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520861281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:42,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:42,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4, 4] total 23 [2022-07-14 07:06:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521263689] [2022-07-14 07:06:42,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 07:06:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 07:06:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-07-14 07:06:42,391 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:42,825 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-14 07:06:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 07:06:42,825 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 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 42 [2022-07-14 07:06:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:42,827 INFO L225 Difference]: With dead ends: 98 [2022-07-14 07:06:42,827 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 07:06:42,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 07:06:42,828 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 471 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:42,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 155 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:06:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 07:06:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2022-07-14 07:06:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-14 07:06:42,830 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2022-07-14 07:06:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:42,831 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-14 07:06:42,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-14 07:06:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:06:42,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:42,831 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:42,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:43,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:43,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2022-07-14 07:06:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:43,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564388877] [2022-07-14 07:06:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:43,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564388877] [2022-07-14 07:06:43,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564388877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389399049] [2022-07-14 07:06:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:43,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:43,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:43,114 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) [2022-07-14 07:06:43,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 07:06:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:43,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 07:06:43,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:43,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:43,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389399049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:43,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:43,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-07-14 07:06:43,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976021889] [2022-07-14 07:06:43,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:43,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 07:06:43,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 07:06:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:06:43,490 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:43,610 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-07-14 07:06:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:06:43,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 43 [2022-07-14 07:06:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:43,611 INFO L225 Difference]: With dead ends: 93 [2022-07-14 07:06:43,611 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 07:06:43,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:06:43,612 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 126 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:43,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 92 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 07:06:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-14 07:06:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-07-14 07:06:43,615 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2022-07-14 07:06:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:43,615 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-07-14 07:06:43,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-07-14 07:06:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 07:06:43,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:43,616 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:43,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:43,834 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,SelfDestructingSolverStorable9 [2022-07-14 07:06:43,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2022-07-14 07:06:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:43,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251940265] [2022-07-14 07:06:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 100 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:44,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251940265] [2022-07-14 07:06:44,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251940265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:44,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450767629] [2022-07-14 07:06:44,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:06:44,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:44,141 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) [2022-07-14 07:06:44,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 07:06:44,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:06:44,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:44,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 07:06:44,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:44,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:44,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450767629] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:44,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:44,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2022-07-14 07:06:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638601346] [2022-07-14 07:06:44,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 07:06:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 07:06:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 07:06:44,766 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:45,513 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-07-14 07:06:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 07:06:45,514 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 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 57 [2022-07-14 07:06:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:45,515 INFO L225 Difference]: With dead ends: 137 [2022-07-14 07:06:45,515 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 07:06:45,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2022-07-14 07:06:45,516 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 663 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:45,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 270 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 07:06:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 07:06:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2022-07-14 07:06:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2022-07-14 07:06:45,519 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2022-07-14 07:06:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:45,519 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2022-07-14 07:06:45,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-07-14 07:06:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 07:06:45,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:45,520 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:45,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:45,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:45,736 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2022-07-14 07:06:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:45,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564046241] [2022-07-14 07:06:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:45,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564046241] [2022-07-14 07:06:45,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564046241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063547424] [2022-07-14 07:06:45,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:06:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:45,861 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) [2022-07-14 07:06:45,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 07:06:45,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 07:06:45,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:45,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 07:06:45,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-14 07:06:46,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-14 07:06:46,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063547424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:46,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:46,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-07-14 07:06:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657715693] [2022-07-14 07:06:46,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:46,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 07:06:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 07:06:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-07-14 07:06:46,879 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:47,286 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-07-14 07:06:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 07:06:47,287 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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 58 [2022-07-14 07:06:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:47,287 INFO L225 Difference]: With dead ends: 121 [2022-07-14 07:06:47,287 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 07:06:47,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2022-07-14 07:06:47,288 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 366 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:47,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 268 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:06:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 07:06:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-14 07:06:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 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) [2022-07-14 07:06:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-14 07:06:47,292 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2022-07-14 07:06:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:47,292 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-14 07:06:47,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-14 07:06:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 07:06:47,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:47,293 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:47,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:47,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:47,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2022-07-14 07:06:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:47,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086091480] [2022-07-14 07:06:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086091480] [2022-07-14 07:06:47,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086091480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524488285] [2022-07-14 07:06:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:47,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:47,557 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) [2022-07-14 07:06:47,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 07:06:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:47,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:06:47,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:47,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524488285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:47,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:47,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-07-14 07:06:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526422890] [2022-07-14 07:06:47,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 07:06:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 07:06:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:06:47,753 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:47,805 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-07-14 07:06:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 07:06:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 70 [2022-07-14 07:06:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:47,806 INFO L225 Difference]: With dead ends: 121 [2022-07-14 07:06:47,806 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 07:06:47,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:06:47,807 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:47,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 178 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 07:06:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-14 07:06:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-07-14 07:06:47,821 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2022-07-14 07:06:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:47,821 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-07-14 07:06:47,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-07-14 07:06:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-14 07:06:47,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:47,822 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:47,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:48,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-14 07:06:48,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2022-07-14 07:06:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348611586] [2022-07-14 07:06:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-14 07:06:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:48,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348611586] [2022-07-14 07:06:48,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348611586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:48,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64728072] [2022-07-14 07:06:48,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 07:06:48,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:48,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:48,124 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) [2022-07-14 07:06:48,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 07:06:48,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 07:06:48,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:48,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 07:06:48,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-14 07:06:48,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:48,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64728072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:48,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 07:06:48,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2022-07-14 07:06:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928435590] [2022-07-14 07:06:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:48,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:06:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:06:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-07-14 07:06:48,613 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:48,722 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-07-14 07:06:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:06:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 87 [2022-07-14 07:06:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:48,723 INFO L225 Difference]: With dead ends: 120 [2022-07-14 07:06:48,723 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 07:06:48,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-07-14 07:06:48,724 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 159 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:48,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 66 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 07:06:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-07-14 07:06:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-07-14 07:06:48,727 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2022-07-14 07:06:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:48,727 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-07-14 07:06:48,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-07-14 07:06:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-14 07:06:48,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:48,729 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:48,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:48,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 07:06:48,939 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2022-07-14 07:06:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:48,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236657954] [2022-07-14 07:06:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:49,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236657954] [2022-07-14 07:06:49,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236657954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:49,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:49,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121767230] [2022-07-14 07:06:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:49,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:06:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:49,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:06:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:06:49,019 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2022-07-14 07:06:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:49,046 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-07-14 07:06:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:06:49,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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 90 [2022-07-14 07:06:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:49,048 INFO L225 Difference]: With dead ends: 118 [2022-07-14 07:06:49,048 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 07:06:49,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:06:49,050 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:49,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 07:06:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-14 07:06:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-07-14 07:06:49,052 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2022-07-14 07:06:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:49,052 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-07-14 07:06:49,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2022-07-14 07:06:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-07-14 07:06:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-14 07:06:49,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:49,055 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 07:06:49,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2022-07-14 07:06:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:49,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023907528] [2022-07-14 07:06:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-14 07:06:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023907528] [2022-07-14 07:06:49,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023907528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:49,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:49,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:06:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158079678] [2022-07-14 07:06:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:49,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:06:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:49,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:06:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:06:49,190 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.2) 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) [2022-07-14 07:06:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:49,285 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-07-14 07:06:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:06:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) 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 90 [2022-07-14 07:06:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:49,286 INFO L225 Difference]: With dead ends: 125 [2022-07-14 07:06:49,286 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 07:06:49,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:06:49,287 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:49,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 07:06:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2022-07-14 07:06:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-07-14 07:06:49,290 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2022-07-14 07:06:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:49,290 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-07-14 07:06:49,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) 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) [2022-07-14 07:06:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-07-14 07:06:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 07:06:49,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:49,291 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:49,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 07:06:49,292 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2022-07-14 07:06:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:49,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423080703] [2022-07-14 07:06:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423080703] [2022-07-14 07:06:49,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423080703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:49,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:49,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235631082] [2022-07-14 07:06:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:49,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:49,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:49,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:49,331 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:49,344 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-07-14 07:06:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:49,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2022-07-14 07:06:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:49,346 INFO L225 Difference]: With dead ends: 119 [2022-07-14 07:06:49,346 INFO L226 Difference]: Without dead ends: 119 [2022-07-14 07:06:49,346 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 [2022-07-14 07:06:49,347 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:49,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-14 07:06:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-14 07:06:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-07-14 07:06:49,349 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2022-07-14 07:06:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:49,350 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-07-14 07:06:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-07-14 07:06:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 07:06:49,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:49,351 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:49,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 07:06:49,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2022-07-14 07:06:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576047842] [2022-07-14 07:06:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:49,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:49,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576047842] [2022-07-14 07:06:49,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576047842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:49,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:49,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:49,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338811284] [2022-07-14 07:06:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:49,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:49,403 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:49,421 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2022-07-14 07:06:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2022-07-14 07:06:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:49,423 INFO L225 Difference]: With dead ends: 122 [2022-07-14 07:06:49,423 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 07:06:49,423 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 [2022-07-14 07:06:49,423 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:49,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 07:06:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2022-07-14 07:06:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-07-14 07:06:49,426 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2022-07-14 07:06:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:49,426 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-07-14 07:06:49,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-07-14 07:06:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-14 07:06:49,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:49,428 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:49,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 07:06:49,428 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2022-07-14 07:06:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:49,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944876157] [2022-07-14 07:06:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:49,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-14 07:06:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:49,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944876157] [2022-07-14 07:06:49,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944876157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:49,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278285485] [2022-07-14 07:06:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:49,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:49,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:49,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:06:49,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 07:06:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:49,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 07:06:49,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:50,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:06:50,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:06:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:50,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:51,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278285485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:51,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:51,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-07-14 07:06:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158246731] [2022-07-14 07:06:51,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:51,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 07:06:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:51,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 07:06:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:06:51,223 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:51,458 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2022-07-14 07:06:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:06:51,458 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 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 95 [2022-07-14 07:06:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:51,459 INFO L225 Difference]: With dead ends: 180 [2022-07-14 07:06:51,459 INFO L226 Difference]: Without dead ends: 180 [2022-07-14 07:06:51,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2022-07-14 07:06:51,460 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 271 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:51,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 158 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-07-14 07:06:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-14 07:06:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2022-07-14 07:06:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2022-07-14 07:06:51,462 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2022-07-14 07:06:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:51,462 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2022-07-14 07:06:51,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2022-07-14 07:06:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-14 07:06:51,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:51,463 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:51,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:51,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:51,679 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2022-07-14 07:06:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:51,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603794320] [2022-07-14 07:06:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:51,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:51,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603794320] [2022-07-14 07:06:51,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603794320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:51,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851730791] [2022-07-14 07:06:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:51,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:51,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:51,732 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:06:51,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 07:06:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:51,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 07:06:51,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:51,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 07:06:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:51,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:51,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851730791] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:51,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:51,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-07-14 07:06:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496639969] [2022-07-14 07:06:51,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:06:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:06:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:06:51,926 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:51,983 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-07-14 07:06:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:06:51,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 96 [2022-07-14 07:06:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:51,985 INFO L225 Difference]: With dead ends: 137 [2022-07-14 07:06:51,985 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 07:06:51,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:51,986 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:51,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 07:06:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-07-14 07:06:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2022-07-14 07:06:51,992 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2022-07-14 07:06:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:51,992 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2022-07-14 07:06:51,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-07-14 07:06:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-14 07:06:51,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:51,993 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:52,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:52,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:52,196 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2022-07-14 07:06:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:52,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499492748] [2022-07-14 07:06:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:52,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:52,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499492748] [2022-07-14 07:06:52,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499492748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:52,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081374658] [2022-07-14 07:06:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:52,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:52,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:52,244 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:06:52,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 07:06:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:52,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 07:06:52,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:52,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:52,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081374658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:52,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:52,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-14 07:06:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109756184] [2022-07-14 07:06:52,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:52,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:06:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:06:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:52,398 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:52,423 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-07-14 07:06:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:06:52,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 103 [2022-07-14 07:06:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:52,424 INFO L225 Difference]: With dead ends: 145 [2022-07-14 07:06:52,425 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 07:06:52,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:52,426 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:52,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 120 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 07:06:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2022-07-14 07:06:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2022-07-14 07:06:52,428 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2022-07-14 07:06:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:52,429 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2022-07-14 07:06:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-07-14 07:06:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 07:06:52,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:52,430 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:52,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:52,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 07:06:52,647 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2022-07-14 07:06:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:52,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658121152] [2022-07-14 07:06:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:52,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-14 07:06:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:52,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658121152] [2022-07-14 07:06:52,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658121152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:52,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030179785] [2022-07-14 07:06:52,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:06:52,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:52,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:52,828 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:06:52,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 07:06:52,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:06:52,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:52,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 07:06:52,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:53,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:06:53,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:06:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:53,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:53,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030179785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:53,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 07:06:53,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-07-14 07:06:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246969801] [2022-07-14 07:06:53,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:06:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:06:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-07-14 07:06:53,586 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:53,744 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-07-14 07:06:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:06:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-14 07:06:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:53,746 INFO L225 Difference]: With dead ends: 142 [2022-07-14 07:06:53,746 INFO L226 Difference]: Without dead ends: 142 [2022-07-14 07:06:53,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-07-14 07:06:53,747 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 135 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:53,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 96 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-14 07:06:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-14 07:06:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2022-07-14 07:06:53,749 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 110 [2022-07-14 07:06:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:53,749 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2022-07-14 07:06:53,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2022-07-14 07:06:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 07:06:53,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:53,749 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:53,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:53,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 07:06:53,950 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2022-07-14 07:06:53,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009337127] [2022-07-14 07:06:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009337127] [2022-07-14 07:06:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009337127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90619175] [2022-07-14 07:06:54,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:06:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:54,048 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:06:54,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 07:06:54,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 07:06:54,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:54,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 07:06:54,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:54,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 07:06:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-14 07:06:54,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-14 07:06:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90619175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:54,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:54,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-07-14 07:06:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632300387] [2022-07-14 07:06:54,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:54,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 07:06:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 07:06:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-14 07:06:54,681 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:54,906 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-07-14 07:06:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 07:06:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 111 [2022-07-14 07:06:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:54,908 INFO L225 Difference]: With dead ends: 142 [2022-07-14 07:06:54,908 INFO L226 Difference]: Without dead ends: 142 [2022-07-14 07:06:54,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2022-07-14 07:06:54,908 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 249 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:54,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 198 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-14 07:06:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2022-07-14 07:06:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2022-07-14 07:06:54,910 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 111 [2022-07-14 07:06:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:54,910 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2022-07-14 07:06:54,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-07-14 07:06:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-14 07:06:54,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:54,911 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:54,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:55,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:55,122 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2022-07-14 07:06:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:55,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847397997] [2022-07-14 07:06:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847397997] [2022-07-14 07:06:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847397997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:06:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809889561] [2022-07-14 07:06:55,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:06:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:55,184 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:06:55,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 07:06:55,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:06:55,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:06:55,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:06:55,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:55,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:06:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-07-14 07:06:55,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809889561] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:06:55,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:06:55,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-07-14 07:06:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321726299] [2022-07-14 07:06:55,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:06:55,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 07:06:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:55,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 07:06:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:06:55,392 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:55,430 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2022-07-14 07:06:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 07:06:55,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 123 [2022-07-14 07:06:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:55,431 INFO L225 Difference]: With dead ends: 161 [2022-07-14 07:06:55,431 INFO L226 Difference]: Without dead ends: 161 [2022-07-14 07:06:55,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:06:55,432 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:55,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 199 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-14 07:06:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-14 07:06:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2022-07-14 07:06:55,434 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2022-07-14 07:06:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:55,435 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2022-07-14 07:06:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:06:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-07-14 07:06:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-14 07:06:55,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:55,436 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:55,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:55,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:06:55,653 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 07:06:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2022-07-14 07:06:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:55,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591328790] [2022-07-14 07:06:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:55,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:55,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 07:06:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:55,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 07:06:55,822 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 07:06:55,823 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2022-07-14 07:06:55,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-07-14 07:06:55,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-07-14 07:06:55,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-07-14 07:06:55,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2022-07-14 07:06:55,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2022-07-14 07:06:55,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2022-07-14 07:06:55,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2022-07-14 07:06:55,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-07-14 07:06:55,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-07-14 07:06:55,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-07-14 07:06:55,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2022-07-14 07:06:55,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2022-07-14 07:06:55,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2022-07-14 07:06:55,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2022-07-14 07:06:55,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2022-07-14 07:06:55,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-07-14 07:06:55,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 07:06:55,829 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:55,832 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:06:55,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:06:55 BoogieIcfgContainer [2022-07-14 07:06:55,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:06:55,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:06:55,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:06:55,900 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:06:55,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:38" (3/4) ... [2022-07-14 07:06:55,902 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 07:06:55,956 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 07:06:55,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:06:55,956 INFO L158 Benchmark]: Toolchain (without parser) took 17658.53ms. Allocated memory was 81.8MB in the beginning and 186.6MB in the end (delta: 104.9MB). Free memory was 42.1MB in the beginning and 66.6MB in the end (delta: -24.5MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,957 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 81.8MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:55,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.71ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 74.0MB in the end (delta: -32.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 72.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,958 INFO L158 Benchmark]: Boogie Preprocessor took 14.91ms. Allocated memory is still 100.7MB. Free memory was 72.1MB in the beginning and 70.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,958 INFO L158 Benchmark]: RCFGBuilder took 334.08ms. Allocated memory is still 100.7MB. Free memory was 70.6MB in the beginning and 56.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,958 INFO L158 Benchmark]: TraceAbstraction took 17052.65ms. Allocated memory was 100.7MB in the beginning and 186.6MB in the end (delta: 86.0MB). Free memory was 56.3MB in the beginning and 77.1MB in the end (delta: -20.8MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,958 INFO L158 Benchmark]: Witness Printer took 56.19ms. Allocated memory is still 186.6MB. Free memory was 77.1MB in the beginning and 66.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 07:06:55,959 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.36ms. Allocated memory is still 81.8MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.71ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 74.0MB in the end (delta: -32.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 72.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.91ms. Allocated memory is still 100.7MB. Free memory was 72.1MB in the beginning and 70.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.08ms. Allocated memory is still 100.7MB. Free memory was 70.6MB in the beginning and 56.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17052.65ms. Allocated memory was 100.7MB in the beginning and 186.6MB in the end (delta: 86.0MB). Free memory was 56.3MB in the beginning and 77.1MB in the end (delta: -20.8MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Witness Printer took 56.19ms. Allocated memory is still 186.6MB. Free memory was 77.1MB in the beginning and 66.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={2:0}, numbers2={3:0}, numbers4={4:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L8] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L12] return array; VAL [\result={2:0}, array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L18] ++i VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L18] ++i VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L18] ++i VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L18] ++i VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L18] ++i VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L18] ++i VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L18] ++i VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L18] ++i VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L18] ++i VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L18] ++i VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L21] return numbers2; VAL [\result={3:0}, array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L27] ++i VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L27] ++i VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L27] ++i VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L27] ++i VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L27] ++i VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L27] ++i VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L27] ++i VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L27] ++i VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L27] ++i VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L27] ++i VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={11:0}, array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers4={4:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L37] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L38] numbers[i] - 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: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3212 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3212 mSDsluCounter, 3127 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29 IncrementalHoareTripleChecker+Unchecked, 2249 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2754 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 878 mSDtfsCounter, 2754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2099 GetRequests, 1769 SyntacticMatches, 2 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=24, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2742 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3372 ConstructedInterpolants, 87 QuantifiedInterpolants, 28390 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3619 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 51 InterpolantComputations, 12 PerfectInterpolantSequences, 11661/12711 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 proved your program to be incorrect! [2022-07-14 07:06:55,989 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)