./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.i --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/forester-heap/sll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:43:56,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:43:56,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:43:56,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:43:56,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:43:56,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:43:56,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:43:56,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:43:56,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:43:56,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:43:56,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:43:56,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:43:56,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:43:56,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:43:56,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:43:56,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:43:56,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:43:56,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:43:56,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:43:56,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:43:56,335 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:43:56,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:43:56,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:43:56,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:43:56,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:43:56,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:43:56,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:43:56,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:43:56,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:43:56,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:43:56,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:43:56,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:43:56,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:43:56,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:43:56,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:43:56,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:43:56,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:43:56,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:43:56,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:43:56,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:43:56,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:43:56,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:43:56,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:43:56,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:43:56,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:43:56,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:43:56,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:43:56,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:43:56,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:43:56,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:43:56,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:43:56,381 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:43:56,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:43:56,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:43:56,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:43:56,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:43:56,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:43:56,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:43:56,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:43:56,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:43:56,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:43:56,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:43:56,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:43:56,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:43:56,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:43:56,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:43:56,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:43:56,385 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2022-07-14 06:43:56,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:43:56,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:43:56,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:43:56,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:43:56,610 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:43:56,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-07-14 06:43:56,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8e33b3b/c915df19e99b457fb3a7ac22f1a85812/FLAGa16897a5b [2022-07-14 06:43:57,106 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:43:57,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-07-14 06:43:57,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8e33b3b/c915df19e99b457fb3a7ac22f1a85812/FLAGa16897a5b [2022-07-14 06:43:57,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8e33b3b/c915df19e99b457fb3a7ac22f1a85812 [2022-07-14 06:43:57,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:43:57,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:43:57,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:43:57,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:43:57,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:43:57,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32afb0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57, skipping insertion in model container [2022-07-14 06:43:57,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:43:57,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:43:57,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-07-14 06:43:57,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-07-14 06:43:57,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-07-14 06:43:57,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:43:57,453 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:43:57,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-07-14 06:43:57,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-07-14 06:43:57,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-07-14 06:43:57,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:43:57,499 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:43:57,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57 WrapperNode [2022-07-14 06:43:57,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:43:57,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:43:57,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:43:57,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:43:57,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,531 INFO L137 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-07-14 06:43:57,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:43:57,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:43:57,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:43:57,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:43:57,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:43:57,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:43:57,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:43:57,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:43:57,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (1/1) ... [2022-07-14 06:43:57,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:43:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:57,605 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 06:43:57,612 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 06:43:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:43:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:43:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:43:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:43:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:43:57,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:43:57,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:43:57,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:43:57,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:43:57,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:43:57,759 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:43:57,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:43:58,024 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:43:58,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:43:58,029 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-14 06:43:58,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:43:58 BoogieIcfgContainer [2022-07-14 06:43:58,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:43:58,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:43:58,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:43:58,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:43:58,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:43:57" (1/3) ... [2022-07-14 06:43:58,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302e90d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:43:58, skipping insertion in model container [2022-07-14 06:43:58,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:57" (2/3) ... [2022-07-14 06:43:58,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302e90d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:43:58, skipping insertion in model container [2022-07-14 06:43:58,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:43:58" (3/3) ... [2022-07-14 06:43:58,036 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2022-07-14 06:43:58,045 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:43:58,045 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-07-14 06:43:58,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:43:58,081 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@2645b63, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e7205e6 [2022-07-14 06:43:58,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-07-14 06:43:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 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 06:43:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:43:58,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:58,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:43:58,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:43:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:58,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199577776] [2022-07-14 06:43:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:58,218 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 06:43:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199577776] [2022-07-14 06:43:58,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199577776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:58,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:58,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:43:58,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562445098] [2022-07-14 06:43:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:58,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:58,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:58,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:58,246 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:58,343 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-07-14 06:43:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:43:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:58,385 INFO L225 Difference]: With dead ends: 108 [2022-07-14 06:43:58,385 INFO L226 Difference]: Without dead ends: 106 [2022-07-14 06:43:58,386 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 06:43:58,388 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:58,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-14 06:43:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2022-07-14 06:43:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 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 06:43:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-14 06:43:58,417 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 3 [2022-07-14 06:43:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-14 06:43:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-14 06:43:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:43:58,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:58,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:43:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:43:58,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:43:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:58,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641420099] [2022-07-14 06:43:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:58,477 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 06:43:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:58,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641420099] [2022-07-14 06:43:58,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641420099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:58,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:58,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:43:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029648191] [2022-07-14 06:43:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:58,485 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:58,580 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-14 06:43:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:58,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:43:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:58,581 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:43:58,581 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:43:58,582 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 06:43:58,582 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:58,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:43:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-07-14 06:43:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 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 06:43:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-14 06:43:58,588 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2022-07-14 06:43:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:58,588 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-14 06:43:58,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-14 06:43:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:43:58,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:58,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:58,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:43:58,590 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2022-07-14 06:43:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:58,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770631465] [2022-07-14 06:43:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:58,644 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 06:43:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770631465] [2022-07-14 06:43:58,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770631465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:58,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:58,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340293379] [2022-07-14 06:43:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:43:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:43:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:43:58,648 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:58,731 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-14 06:43:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:43:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:43:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:58,734 INFO L225 Difference]: With dead ends: 90 [2022-07-14 06:43:58,735 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 06:43:58,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:58,739 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:58,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 52 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 06:43:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2022-07-14 06:43:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 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 06:43:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-14 06:43:58,751 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 8 [2022-07-14 06:43:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:58,752 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-14 06:43:58,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-14 06:43:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:43:58,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:58,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:58,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:43:58,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 59263653, now seen corresponding path program 1 times [2022-07-14 06:43:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:58,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85751792] [2022-07-14 06:43:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:58,801 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 06:43:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:58,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85751792] [2022-07-14 06:43:58,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85751792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:58,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:58,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:58,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475778046] [2022-07-14 06:43:58,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:58,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:43:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:58,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:43:58,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:43:58,804 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:58,891 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-07-14 06:43:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:43:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:43:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:58,893 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:43:58,893 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:43:58,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:58,894 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:58,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 97 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:43:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2022-07-14 06:43:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:43:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-14 06:43:58,897 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 8 [2022-07-14 06:43:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:58,898 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-14 06:43:58,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-14 06:43:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:43:58,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:58,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:58,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:43:58,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash 460324999, now seen corresponding path program 1 times [2022-07-14 06:43:58,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:58,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131718571] [2022-07-14 06:43:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:59,023 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 06:43:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131718571] [2022-07-14 06:43:59,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131718571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:59,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:59,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:43:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018427495] [2022-07-14 06:43:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:59,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:43:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:59,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:43:59,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:43:59,026 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 06:43:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:59,190 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-07-14 06:43:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:43:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:43:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:59,191 INFO L225 Difference]: With dead ends: 170 [2022-07-14 06:43:59,191 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 06:43:59,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:43:59,192 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 316 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:59,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 295 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 06:43:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 90. [2022-07-14 06:43:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 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 06:43:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-07-14 06:43:59,195 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2022-07-14 06:43:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:59,196 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-07-14 06:43:59,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 06:43:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-07-14 06:43:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:43:59,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:59,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:59,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:43:59,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-14 06:43:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215493148] [2022-07-14 06:43:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:59,241 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 06:43:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215493148] [2022-07-14 06:43:59,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215493148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:59,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:59,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375150330] [2022-07-14 06:43:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:59,243 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 06:43:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:59,391 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-07-14 06:43:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:43:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:43:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:59,392 INFO L225 Difference]: With dead ends: 89 [2022-07-14 06:43:59,392 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 06:43:59,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:43:59,393 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:59,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 06:43:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-14 06:43:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 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 06:43:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-07-14 06:43:59,395 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2022-07-14 06:43:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:59,396 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-07-14 06:43:59,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 06:43:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-07-14 06:43:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:43:59,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:59,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:43:59,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-14 06:43:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:59,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570031618] [2022-07-14 06:43:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:59,466 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 06:43:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:59,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570031618] [2022-07-14 06:43:59,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570031618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:59,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:59,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940976977] [2022-07-14 06:43:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:59,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:59,468 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 06:43:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:59,618 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-07-14 06:43:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:43:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:43:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:59,619 INFO L225 Difference]: With dead ends: 85 [2022-07-14 06:43:59,619 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:43:59,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:43:59,620 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 22 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:59,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:43:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-14 06:43:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 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 06:43:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-07-14 06:43:59,622 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 12 [2022-07-14 06:43:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:59,622 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-07-14 06:43:59,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 06:43:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-07-14 06:43:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:43:59,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:59,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:59,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:43:59,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177244, now seen corresponding path program 1 times [2022-07-14 06:43:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:59,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947972870] [2022-07-14 06:43:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:59,728 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 06:43:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947972870] [2022-07-14 06:43:59,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947972870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:59,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:59,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:43:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113870674] [2022-07-14 06:43:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:59,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:43:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:43:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:43:59,731 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:59,905 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-07-14 06:43:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:43:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:43:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:59,906 INFO L225 Difference]: With dead ends: 124 [2022-07-14 06:43:59,906 INFO L226 Difference]: Without dead ends: 124 [2022-07-14 06:43:59,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:43:59,907 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 249 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:59,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 202 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-14 06:43:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2022-07-14 06:43:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 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 06:43:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-07-14 06:43:59,910 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 13 [2022-07-14 06:43:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:59,910 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-07-14 06:43:59,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-07-14 06:43:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:43:59,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:59,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:59,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:43:59,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:43:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:59,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177245, now seen corresponding path program 1 times [2022-07-14 06:43:59,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:59,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112261168] [2022-07-14 06:43:59,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:59,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:00,013 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 06:44:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:00,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112261168] [2022-07-14 06:44:00,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112261168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:00,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:00,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:44:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885965904] [2022-07-14 06:44:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:00,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:44:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:44:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:44:00,016 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:00,225 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-07-14 06:44:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:44:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:44:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:00,227 INFO L225 Difference]: With dead ends: 158 [2022-07-14 06:44:00,227 INFO L226 Difference]: Without dead ends: 158 [2022-07-14 06:44:00,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:00,227 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 277 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:00,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 236 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-14 06:44:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2022-07-14 06:44:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 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 06:44:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-07-14 06:44:00,230 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 13 [2022-07-14 06:44:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:00,230 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-07-14 06:44:00,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-07-14 06:44:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:44:00,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:00,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:00,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:44:00,232 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash -230426379, now seen corresponding path program 1 times [2022-07-14 06:44:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029590932] [2022-07-14 06:44:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:00,325 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 06:44:00,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:00,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029590932] [2022-07-14 06:44:00,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029590932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:00,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:00,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:44:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872865187] [2022-07-14 06:44:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:44:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:44:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:44:00,327 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:00,567 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-07-14 06:44:00,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:44:00,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:44:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:00,568 INFO L225 Difference]: With dead ends: 143 [2022-07-14 06:44:00,568 INFO L226 Difference]: Without dead ends: 143 [2022-07-14 06:44:00,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:44:00,568 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 251 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:00,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 341 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-14 06:44:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2022-07-14 06:44:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 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 06:44:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-14 06:44:00,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 16 [2022-07-14 06:44:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:00,571 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-14 06:44:00,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-14 06:44:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:44:00,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:00,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:00,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:44:00,571 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:00,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash -230426378, now seen corresponding path program 1 times [2022-07-14 06:44:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:00,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607725513] [2022-07-14 06:44:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:00,671 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 06:44:00,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:00,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607725513] [2022-07-14 06:44:00,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607725513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:00,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:00,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:44:00,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059759846] [2022-07-14 06:44:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:00,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:44:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:44:00,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:44:00,673 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:00,874 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-14 06:44:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:44:00,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:44:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:00,875 INFO L225 Difference]: With dead ends: 153 [2022-07-14 06:44:00,876 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:44:00,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:44:00,877 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 216 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:00,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 248 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:44:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2022-07-14 06:44:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 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 06:44:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-14 06:44:00,880 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 16 [2022-07-14 06:44:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:00,880 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-14 06:44:00,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-14 06:44:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:44:00,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:00,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:00,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:44:00,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702036, now seen corresponding path program 1 times [2022-07-14 06:44:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:00,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108145982] [2022-07-14 06:44:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:00,936 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 06:44:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108145982] [2022-07-14 06:44:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108145982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:00,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:00,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:44:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428795490] [2022-07-14 06:44:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:44:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:44:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:44:00,938 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 06:44:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:01,091 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-07-14 06:44:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-14 06:44:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:01,092 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:44:01,093 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:44:01,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:44:01,093 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 231 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:01,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 210 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:44:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2022-07-14 06:44:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 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 06:44:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-07-14 06:44:01,095 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 17 [2022-07-14 06:44:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:01,095 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-07-14 06:44:01,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 06:44:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-07-14 06:44:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:44:01,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:01,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:01,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:44:01,096 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:01,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702037, now seen corresponding path program 1 times [2022-07-14 06:44:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:01,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426940734] [2022-07-14 06:44:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:01,188 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 06:44:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426940734] [2022-07-14 06:44:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426940734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:01,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:01,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:44:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522340849] [2022-07-14 06:44:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:01,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:44:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:44:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:44:01,190 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 06:44:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:01,371 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-07-14 06:44:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:44:01,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-14 06:44:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:01,372 INFO L225 Difference]: With dead ends: 152 [2022-07-14 06:44:01,372 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 06:44:01,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:01,373 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 205 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:01,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 199 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 06:44:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2022-07-14 06:44:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 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 06:44:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2022-07-14 06:44:01,375 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 17 [2022-07-14 06:44:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:01,375 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2022-07-14 06:44:01,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 06:44:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2022-07-14 06:44:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:44:01,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:01,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:01,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:44:01,376 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:01,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1499460812, now seen corresponding path program 1 times [2022-07-14 06:44:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:01,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363283294] [2022-07-14 06:44:01,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:01,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:01,412 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 06:44:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363283294] [2022-07-14 06:44:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363283294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:01,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:01,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:44:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941251129] [2022-07-14 06:44:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:01,414 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 06:44:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:01,484 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-07-14 06:44:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:44:01,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-14 06:44:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:01,485 INFO L225 Difference]: With dead ends: 119 [2022-07-14 06:44:01,485 INFO L226 Difference]: Without dead ends: 119 [2022-07-14 06:44:01,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:01,486 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:01,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 307 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:44:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-14 06:44:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2022-07-14 06:44:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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 06:44:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-07-14 06:44:01,488 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2022-07-14 06:44:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:01,488 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-07-14 06:44:01,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 06:44:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-07-14 06:44:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:44:01,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:01,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:01,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:44:01,489 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1296321320, now seen corresponding path program 1 times [2022-07-14 06:44:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:01,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500812450] [2022-07-14 06:44:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:01,572 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 06:44:01,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:01,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500812450] [2022-07-14 06:44:01,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500812450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:01,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:01,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:44:01,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798647074] [2022-07-14 06:44:01,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:01,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:44:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:44:01,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:44:01,574 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:01,692 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-07-14 06:44:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:44:01,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-14 06:44:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:01,693 INFO L225 Difference]: With dead ends: 146 [2022-07-14 06:44:01,693 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 06:44:01,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:01,694 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 163 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:01,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 248 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 06:44:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2022-07-14 06:44:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 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 06:44:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-07-14 06:44:01,699 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 20 [2022-07-14 06:44:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:01,699 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-07-14 06:44:01,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-07-14 06:44:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:44:01,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:01,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:01,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:44:01,702 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash -852633064, now seen corresponding path program 1 times [2022-07-14 06:44:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592431718] [2022-07-14 06:44:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:01,724 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 06:44:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:01,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592431718] [2022-07-14 06:44:01,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592431718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:01,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:01,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:44:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325053444] [2022-07-14 06:44:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:01,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:44:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:44:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:01,727 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:01,731 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-07-14 06:44:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:44:01,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-14 06:44:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:01,732 INFO L225 Difference]: With dead ends: 119 [2022-07-14 06:44:01,732 INFO L226 Difference]: Without dead ends: 119 [2022-07-14 06:44:01,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:01,733 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:01,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:44:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-14 06:44:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-14 06:44:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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 06:44:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2022-07-14 06:44:01,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 20 [2022-07-14 06:44:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:01,736 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2022-07-14 06:44:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-07-14 06:44:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:44:01,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:01,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:44:01,738 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash -661774329, now seen corresponding path program 1 times [2022-07-14 06:44:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519146229] [2022-07-14 06:44:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:01,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:01,774 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 06:44:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519146229] [2022-07-14 06:44:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519146229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:01,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:01,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:44:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423828840] [2022-07-14 06:44:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:01,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:44:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:44:01,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:44:01,776 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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 06:44:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:01,837 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-14 06:44:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:44:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:44:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:01,838 INFO L225 Difference]: With dead ends: 118 [2022-07-14 06:44:01,838 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 06:44:01,838 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 06:44:01,839 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:01,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 06:44:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-14 06:44:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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 06:44:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2022-07-14 06:44:01,841 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 21 [2022-07-14 06:44:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:01,841 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-14 06:44:01,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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 06:44:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2022-07-14 06:44:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:44:01,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:01,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:01,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:44:01,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -661774328, now seen corresponding path program 1 times [2022-07-14 06:44:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:01,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904251992] [2022-07-14 06:44:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:01,931 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 06:44:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904251992] [2022-07-14 06:44:01,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904251992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:01,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:01,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:44:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477090490] [2022-07-14 06:44:01,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:01,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:44:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:44:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:01,933 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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 06:44:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:02,190 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-07-14 06:44:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:44:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:44:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:02,191 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:44:02,191 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 06:44:02,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:44:02,192 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 171 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:02,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 393 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 06:44:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2022-07-14 06:44:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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 06:44:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2022-07-14 06:44:02,194 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2022-07-14 06:44:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:02,194 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2022-07-14 06:44:02,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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 06:44:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2022-07-14 06:44:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:44:02,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:02,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:02,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:44:02,195 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2015766217, now seen corresponding path program 1 times [2022-07-14 06:44:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:02,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738173954] [2022-07-14 06:44:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:02,214 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 06:44:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738173954] [2022-07-14 06:44:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738173954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:02,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:02,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:44:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634567192] [2022-07-14 06:44:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:02,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:44:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:44:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:02,215 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:02,223 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-07-14 06:44:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:44:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:44:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:02,224 INFO L225 Difference]: With dead ends: 185 [2022-07-14 06:44:02,224 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 06:44:02,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:02,225 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:02,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:44:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 06:44:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2022-07-14 06:44:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 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 06:44:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-07-14 06:44:02,228 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2022-07-14 06:44:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:02,228 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-07-14 06:44:02,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-07-14 06:44:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:44:02,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:02,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:44:02,229 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash -224265605, now seen corresponding path program 1 times [2022-07-14 06:44:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309050255] [2022-07-14 06:44:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:02,324 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 06:44:02,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:02,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309050255] [2022-07-14 06:44:02,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309050255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:02,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:02,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:44:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896389922] [2022-07-14 06:44:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:02,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:44:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:44:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:44:02,326 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:02,512 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-07-14 06:44:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:44:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:02,513 INFO L225 Difference]: With dead ends: 149 [2022-07-14 06:44:02,513 INFO L226 Difference]: Without dead ends: 149 [2022-07-14 06:44:02,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:44:02,513 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 196 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:02,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 335 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-14 06:44:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2022-07-14 06:44:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 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 06:44:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2022-07-14 06:44:02,515 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 22 [2022-07-14 06:44:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:02,515 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2022-07-14 06:44:02,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2022-07-14 06:44:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:44:02,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:02,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:02,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:44:02,516 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -350969464, now seen corresponding path program 1 times [2022-07-14 06:44:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:02,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711407688] [2022-07-14 06:44:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:02,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:02,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711407688] [2022-07-14 06:44:02,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711407688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:02,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:02,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:44:02,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134619894] [2022-07-14 06:44:02,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:02,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:02,551 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:02,644 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-07-14 06:44:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:44:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:44:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:02,645 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:44:02,645 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:44:02,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:02,646 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:02,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 154 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:44:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-07-14 06:44:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 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 06:44:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-07-14 06:44:02,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 23 [2022-07-14 06:44:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:02,648 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-07-14 06:44:02,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-07-14 06:44:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:44:02,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:02,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:02,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:44:02,649 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash -350969463, now seen corresponding path program 1 times [2022-07-14 06:44:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:02,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993812504] [2022-07-14 06:44:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:02,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993812504] [2022-07-14 06:44:02,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993812504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980904661] [2022-07-14 06:44:02,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:02,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:02,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:02,774 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 06:44:02,786 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 06:44:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:02,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:44:02,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:02,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:44:02,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 06:44:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:02,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:02,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980904661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:02,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:44:02,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-07-14 06:44:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059018572] [2022-07-14 06:44:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:02,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:44:02,942 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:03,075 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-07-14 06:44:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:44:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:44:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:03,076 INFO L225 Difference]: With dead ends: 132 [2022-07-14 06:44:03,076 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:44:03,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:44:03,077 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:03,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:44:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-14 06:44:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 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 06:44:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2022-07-14 06:44:03,096 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 23 [2022-07-14 06:44:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:03,096 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-07-14 06:44:03,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2022-07-14 06:44:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:44:03,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:03,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:03,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:03,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:44:03,297 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1019044192, now seen corresponding path program 1 times [2022-07-14 06:44:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:03,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367285501] [2022-07-14 06:44:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:03,413 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 06:44:03,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:03,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367285501] [2022-07-14 06:44:03,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367285501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:03,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:03,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:44:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553978017] [2022-07-14 06:44:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:03,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:44:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:44:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:44:03,415 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:03,679 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-07-14 06:44:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:44:03,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:44:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:03,680 INFO L225 Difference]: With dead ends: 144 [2022-07-14 06:44:03,680 INFO L226 Difference]: Without dead ends: 144 [2022-07-14 06:44:03,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:44:03,681 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:03,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 432 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-14 06:44:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2022-07-14 06:44:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 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 06:44:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-07-14 06:44:03,683 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 24 [2022-07-14 06:44:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:03,683 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-14 06:44:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-07-14 06:44:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:44:03,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:03,685 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:03,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:44:03,686 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1710834765, now seen corresponding path program 1 times [2022-07-14 06:44:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:03,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615111967] [2022-07-14 06:44:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:03,796 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 06:44:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615111967] [2022-07-14 06:44:03,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615111967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251733447] [2022-07-14 06:44:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:03,798 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 06:44:03,799 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 06:44:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:03,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:44:03,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:03,882 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 06:44:03,925 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:44:03,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:44:03,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:04,047 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:04,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-14 06:44:04,070 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:04,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-14 06:44:04,106 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:04,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:44:04,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:44:04,130 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 06:44:04,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:04,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 06:44:04,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 06:44:04,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_551) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 06:44:04,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:04,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-14 06:44:04,191 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:04,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-14 06:44:04,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-14 06:44:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:44:04,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251733447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:04,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:44:04,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-07-14 06:44:04,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900719477] [2022-07-14 06:44:04,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:04,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:44:04,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:04,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:44:04,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=401, Unknown=3, NotChecked=126, Total=600 [2022-07-14 06:44:04,295 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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 06:44:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:04,891 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2022-07-14 06:44:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:44:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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 24 [2022-07-14 06:44:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:04,893 INFO L225 Difference]: With dead ends: 235 [2022-07-14 06:44:04,893 INFO L226 Difference]: Without dead ends: 235 [2022-07-14 06:44:04,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=804, Unknown=3, NotChecked=186, Total=1190 [2022-07-14 06:44:04,894 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 220 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:04,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 859 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 999 Invalid, 0 Unknown, 469 Unchecked, 0.4s Time] [2022-07-14 06:44:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-14 06:44:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 152. [2022-07-14 06:44:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 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 06:44:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2022-07-14 06:44:04,896 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 24 [2022-07-14 06:44:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:04,896 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2022-07-14 06:44:04,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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 06:44:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-07-14 06:44:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:44:04,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:04,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:04,915 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 06:44:05,107 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,SelfDestructingSolverStorable23 [2022-07-14 06:44:05,107 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2020763981, now seen corresponding path program 1 times [2022-07-14 06:44:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:05,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725972512] [2022-07-14 06:44:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:05,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725972512] [2022-07-14 06:44:05,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725972512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768587172] [2022-07-14 06:44:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:05,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:05,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:05,212 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 06:44:05,213 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 06:44:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:05,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:44:05,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:05,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-14 06:44:05,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-14 06:44:05,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:44:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:05,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:05,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768587172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:05,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:44:05,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-07-14 06:44:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752106481] [2022-07-14 06:44:05,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:05,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:44:05,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:05,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:44:05,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:44:05,381 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:05,555 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2022-07-14 06:44:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:44:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:05,556 INFO L225 Difference]: With dead ends: 170 [2022-07-14 06:44:05,556 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 06:44:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:44:05,557 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:05,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 06:44:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2022-07-14 06:44:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 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 06:44:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2022-07-14 06:44:05,567 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 25 [2022-07-14 06:44:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:05,567 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2022-07-14 06:44:05,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2022-07-14 06:44:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:44:05,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:05,568 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:05,584 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 06:44:05,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:05,768 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1496266000, now seen corresponding path program 1 times [2022-07-14 06:44:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:05,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048420573] [2022-07-14 06:44:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:05,854 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 06:44:05,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:05,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048420573] [2022-07-14 06:44:05,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048420573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:05,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681850151] [2022-07-14 06:44:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:05,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:05,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:05,856 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 06:44:05,857 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 06:44:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:05,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:44:05,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:05,958 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 06:44:05,997 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:44:05,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:44:06,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:06,104 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:06,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:44:06,134 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:06,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:44:06,177 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:06,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:44:06,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:44:06,257 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 06:44:06,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:06,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-14 06:44:06,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-14 06:44:06,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:06,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 06:44:06,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:06,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 06:44:06,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 06:44:08,598 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 06:44:08,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681850151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:08,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:44:08,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-07-14 06:44:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458669668] [2022-07-14 06:44:08,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:08,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 06:44:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 06:44:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=439, Unknown=10, NotChecked=90, Total=650 [2022-07-14 06:44:08,600 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 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 06:44:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:08,893 INFO L93 Difference]: Finished difference Result 200 states and 233 transitions. [2022-07-14 06:44:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:44:08,893 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 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 25 [2022-07-14 06:44:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:08,894 INFO L225 Difference]: With dead ends: 200 [2022-07-14 06:44:08,894 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 06:44:08,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=224, Invalid=765, Unknown=11, NotChecked=122, Total=1122 [2022-07-14 06:44:08,895 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 126 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:08,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 580 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 322 Invalid, 0 Unknown, 554 Unchecked, 0.1s Time] [2022-07-14 06:44:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 06:44:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 167. [2022-07-14 06:44:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 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 06:44:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2022-07-14 06:44:08,897 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 25 [2022-07-14 06:44:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:08,897 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2022-07-14 06:44:08,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 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 06:44:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2022-07-14 06:44:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:44:08,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:08,898 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:08,917 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 06:44:09,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-14 06:44:09,103 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1496265999, now seen corresponding path program 1 times [2022-07-14 06:44:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:09,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110975800] [2022-07-14 06:44:09,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:09,130 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-14 06:44:09,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:44:09,149 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 06:44:09,156 INFO L158 Benchmark]: Toolchain (without parser) took 12021.80ms. Allocated memory was 86.0MB in the beginning and 163.6MB in the end (delta: 77.6MB). Free memory was 48.2MB in the beginning and 58.0MB in the end (delta: -9.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2022-07-14 06:44:09,156 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:44:09,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.31ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 48.0MB in the beginning and 79.9MB in the end (delta: -31.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 06:44:09,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.39ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 77.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:44:09,156 INFO L158 Benchmark]: Boogie Preprocessor took 44.82ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 76.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:44:09,157 INFO L158 Benchmark]: RCFGBuilder took 450.17ms. Allocated memory is still 113.2MB. Free memory was 76.1MB in the beginning and 58.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-14 06:44:09,157 INFO L158 Benchmark]: TraceAbstraction took 11124.10ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 58.5MB in the beginning and 58.0MB in the end (delta: 498.0kB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2022-07-14 06:44:09,159 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.31ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 48.0MB in the beginning and 79.9MB in the end (delta: -31.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.39ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 77.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.82ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 76.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 450.17ms. Allocated memory is still 113.2MB. Free memory was 76.1MB in the beginning and 58.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11124.10ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 58.5MB in the beginning and 58.0MB in the end (delta: 498.0kB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:44:09,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:44:10,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:44:10,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:44:10,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:44:10,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:44:10,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:44:10,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:44:10,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:44:10,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:44:10,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:44:10,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:44:10,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:44:10,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:44:10,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:44:10,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:44:10,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:44:10,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:44:10,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:44:10,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:44:10,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:44:10,786 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:44:10,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:44:10,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:44:10,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:44:10,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:44:10,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:44:10,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:44:10,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:44:10,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:44:10,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:44:10,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:44:10,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:44:10,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:44:10,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:44:10,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:44:10,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:44:10,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:44:10,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:44:10,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:44:10,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:44:10,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:44:10,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:44:10,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:44:10,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:44:10,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:44:10,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:44:10,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:44:10,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:44:10,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:44:10,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:44:10,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:44:10,840 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:44:10,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:44:10,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:44:10,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:44:10,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:44:10,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:44:10,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:44:10,842 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:44:10,842 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:44:10,842 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:44:10,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:44:10,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:44:10,843 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:44:10,843 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:44:10,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:44:10,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:44:10,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:44:10,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:44:10,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:44:10,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:44:10,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:44:10,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:44:10,844 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:44:10,845 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:44:10,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:44:10,845 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2022-07-14 06:44:11,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:44:11,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:44:11,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:44:11,114 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:44:11,115 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:44:11,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-07-14 06:44:11,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178eb9969/2571fe137562449580d0e26388edebf7/FLAG48e3a9100 [2022-07-14 06:44:11,552 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:44:11,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-07-14 06:44:11,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178eb9969/2571fe137562449580d0e26388edebf7/FLAG48e3a9100 [2022-07-14 06:44:11,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178eb9969/2571fe137562449580d0e26388edebf7 [2022-07-14 06:44:11,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:44:11,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:44:11,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:44:11,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:44:11,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:44:11,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:44:11" (1/1) ... [2022-07-14 06:44:11,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f2874a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:11, skipping insertion in model container [2022-07-14 06:44:11,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:44:11" (1/1) ... [2022-07-14 06:44:11,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:44:12,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:44:12,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-07-14 06:44:12,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-07-14 06:44:12,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-07-14 06:44:12,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:44:12,229 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:44:12,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-07-14 06:44:12,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-07-14 06:44:12,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-07-14 06:44:12,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:44:12,298 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:44:12,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12 WrapperNode [2022-07-14 06:44:12,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:44:12,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:44:12,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:44:12,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:44:12,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,353 INFO L137 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2022-07-14 06:44:12,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:44:12,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:44:12,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:44:12,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:44:12,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:44:12,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:44:12,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:44:12,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:44:12,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (1/1) ... [2022-07-14 06:44:12,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:44:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:12,422 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 06:44:12,439 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 06:44:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:44:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:44:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:44:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:44:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:44:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:44:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:44:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:44:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:44:12,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:44:12,551 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:44:12,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:44:12,836 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:44:12,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:44:12,841 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-14 06:44:12,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:44:12 BoogieIcfgContainer [2022-07-14 06:44:12,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:44:12,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:44:12,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:44:12,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:44:12,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:44:11" (1/3) ... [2022-07-14 06:44:12,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fed10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:44:12, skipping insertion in model container [2022-07-14 06:44:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:44:12" (2/3) ... [2022-07-14 06:44:12,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fed10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:44:12, skipping insertion in model container [2022-07-14 06:44:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:44:12" (3/3) ... [2022-07-14 06:44:12,848 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2022-07-14 06:44:12,857 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:44:12,857 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-07-14 06:44:12,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:44:12,902 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@2e648511, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@414baba1 [2022-07-14 06:44:12,905 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-07-14 06:44:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 53 states have (on average 2.2264150943396226) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 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 06:44:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:44:12,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:12,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:44:12,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:44:12,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902385565] [2022-07-14 06:44:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:12,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:12,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:12,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:44:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:12,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:44:13,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:13,047 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 06:44:13,057 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 06:44:13,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:13,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:13,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902385565] [2022-07-14 06:44:13,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902385565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:13,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:13,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:44:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294051708] [2022-07-14 06:44:13,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:44:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:44:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:13,085 INFO L87 Difference]: Start difference. First operand has 100 states, 53 states have (on average 2.2264150943396226) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:13,194 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-07-14 06:44:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:44:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:44:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:13,203 INFO L225 Difference]: With dead ends: 106 [2022-07-14 06:44:13,203 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:44:13,204 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 06:44:13,208 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:13,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:44:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-07-14 06:44:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 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 06:44:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-14 06:44:13,236 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 3 [2022-07-14 06:44:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:13,236 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-14 06:44:13,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-14 06:44:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:44:13,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:13,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:44:13,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:13,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:13,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:44:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:13,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672251112] [2022-07-14 06:44:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:13,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:13,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:13,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:13,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:44:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:13,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:44:13,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:13,480 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 06:44:13,486 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 06:44:13,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:13,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672251112] [2022-07-14 06:44:13,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672251112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:13,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:13,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:44:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237504207] [2022-07-14 06:44:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:13,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:44:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:44:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:13,488 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:13,594 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-14 06:44:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:44:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:44:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:13,595 INFO L225 Difference]: With dead ends: 102 [2022-07-14 06:44:13,595 INFO L226 Difference]: Without dead ends: 102 [2022-07-14 06:44:13,596 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 06:44:13,596 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:13,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 75 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-14 06:44:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-07-14 06:44:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 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 06:44:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-07-14 06:44:13,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 3 [2022-07-14 06:44:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:13,604 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-07-14 06:44:13,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-07-14 06:44:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:44:13,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:13,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:13,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-14 06:44:13,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:13,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027163, now seen corresponding path program 1 times [2022-07-14 06:44:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:13,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096088008] [2022-07-14 06:44:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:13,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:13,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:44:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:13,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:44:13,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:13,859 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 06:44:13,872 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 06:44:13,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:13,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:13,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096088008] [2022-07-14 06:44:13,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096088008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:13,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:13,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:44:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092303139] [2022-07-14 06:44:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:13,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:44:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:44:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:44:13,874 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:14,030 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-14 06:44:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:44:14,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:44:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:14,031 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:44:14,031 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:44:14,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:44:14,032 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 134 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:14,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 50 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:44:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-07-14 06:44:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 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 06:44:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-07-14 06:44:14,037 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 7 [2022-07-14 06:44:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:14,037 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-07-14 06:44:14,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-07-14 06:44:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:44:14,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:14,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:14,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:14,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:14,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027164, now seen corresponding path program 1 times [2022-07-14 06:44:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:14,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897754289] [2022-07-14 06:44:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:14,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:14,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:14,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:44:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:14,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:44:14,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:14,291 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 06:44:14,326 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 06:44:14,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:14,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897754289] [2022-07-14 06:44:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897754289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:14,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:14,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:44:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212950380] [2022-07-14 06:44:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:44:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:44:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:44:14,328 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:14,504 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-07-14 06:44:14,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:44:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:44:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:14,506 INFO L225 Difference]: With dead ends: 98 [2022-07-14 06:44:14,506 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 06:44:14,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:44:14,507 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:14,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 93 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 06:44:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2022-07-14 06:44:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 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 06:44:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-14 06:44:14,512 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 7 [2022-07-14 06:44:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:14,512 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-14 06:44:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-14 06:44:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:44:14,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:14,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:14,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 06:44:14,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:14,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 399103166, now seen corresponding path program 1 times [2022-07-14 06:44:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:14,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742408989] [2022-07-14 06:44:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:14,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:14,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:14,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:14,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:44:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:44:14,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:14,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:14,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:14,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:44:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:14,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:44:14,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-14 06:44:14,915 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 06:44:14,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:14,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:14,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742408989] [2022-07-14 06:44:14,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742408989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:14,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:14,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:44:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195409242] [2022-07-14 06:44:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:44:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:44:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:44:14,918 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 06:44:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:15,196 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-07-14 06:44:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:44:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 11 [2022-07-14 06:44:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:15,198 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:44:15,198 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:44:15,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:15,199 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 228 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:15,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 287 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:44:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 87. [2022-07-14 06:44:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:44:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-14 06:44:15,204 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 11 [2022-07-14 06:44:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:15,204 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-14 06:44:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 06:44:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-14 06:44:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:44:15,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:15,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:15,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:15,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:15,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-14 06:44:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884079734] [2022-07-14 06:44:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:15,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:15,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:15,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:44:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:15,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:44:15,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:15,475 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 06:44:15,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:15,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:44:15,514 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 06:44:15,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:15,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884079734] [2022-07-14 06:44:15,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884079734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:15,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:15,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:44:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326344674] [2022-07-14 06:44:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:15,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:15,516 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 06:44:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:15,750 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-07-14 06:44:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:44:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 11 [2022-07-14 06:44:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:15,751 INFO L225 Difference]: With dead ends: 86 [2022-07-14 06:44:15,751 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 06:44:15,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:15,752 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:15,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 06:44:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-14 06:44:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:44:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-07-14 06:44:15,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 11 [2022-07-14 06:44:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:15,755 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-07-14 06:44:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 06:44:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-07-14 06:44:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:44:15,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:15,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:15,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:15,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:15,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-14 06:44:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:15,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243165646] [2022-07-14 06:44:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:15,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:15,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:15,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:44:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:16,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:44:16,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:16,015 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 06:44:16,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:16,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:16,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:44:16,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:16,097 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 06:44:16,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:16,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:16,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243165646] [2022-07-14 06:44:16,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243165646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:16,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:16,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:44:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890676727] [2022-07-14 06:44:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:16,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:16,099 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 06:44:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:16,384 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-07-14 06:44:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:44:16,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 11 [2022-07-14 06:44:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:16,385 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:44:16,385 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:44:16,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:16,386 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 20 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:16,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 225 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:44:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-07-14 06:44:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 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 06:44:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-14 06:44:16,389 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2022-07-14 06:44:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:16,389 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-14 06:44:16,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 06:44:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-14 06:44:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:44:16,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:16,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:16,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:16,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:16,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash -512699581, now seen corresponding path program 1 times [2022-07-14 06:44:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:16,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808883670] [2022-07-14 06:44:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:16,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:16,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:44:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:16,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:44:16,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:16,675 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 06:44:16,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:16,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:16,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:16,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:16,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:16,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:16,781 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 06:44:16,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:16,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:16,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808883670] [2022-07-14 06:44:16,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808883670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:16,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:16,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:44:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235831858] [2022-07-14 06:44:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:16,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:44:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:16,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:44:16,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:44:16,788 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 06:44:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:17,047 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-07-14 06:44:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:44:17,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:44:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:17,048 INFO L225 Difference]: With dead ends: 128 [2022-07-14 06:44:17,048 INFO L226 Difference]: Without dead ends: 128 [2022-07-14 06:44:17,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:17,050 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 193 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:17,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 143 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-14 06:44:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2022-07-14 06:44:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 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 06:44:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-07-14 06:44:17,069 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 12 [2022-07-14 06:44:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:17,069 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-07-14 06:44:17,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 06:44:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-07-14 06:44:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:44:17,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:17,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:17,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:17,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:17,274 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -512699580, now seen corresponding path program 1 times [2022-07-14 06:44:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:17,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334303791] [2022-07-14 06:44:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:17,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:17,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:17,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:44:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:17,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:44:17,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:17,340 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 06:44:17,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:17,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:17,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:17,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:17,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:17,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:17,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:17,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:17,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:17,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:17,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:17,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:17,493 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 06:44:17,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:17,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:17,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334303791] [2022-07-14 06:44:17,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334303791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:17,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:17,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:44:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250976705] [2022-07-14 06:44:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:17,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:44:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:44:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:44:17,496 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 06:44:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:17,827 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-07-14 06:44:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:44:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:44:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:17,828 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:44:17,828 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:44:17,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:17,829 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 162 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:17,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 226 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:44:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:44:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 92. [2022-07-14 06:44:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 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 06:44:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-07-14 06:44:17,831 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 12 [2022-07-14 06:44:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:17,832 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-07-14 06:44:17,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 06:44:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-07-14 06:44:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:44:17,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:17,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:17,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:18,039 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -929437396, now seen corresponding path program 1 times [2022-07-14 06:44:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156568618] [2022-07-14 06:44:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:18,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:18,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:18,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:18,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:44:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:18,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 06:44:18,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:18,148 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:44:18,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-14 06:44:18,155 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 06:44:18,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:18,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:18,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:18,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:18,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:18,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:18,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:18,537 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:44:18,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2022-07-14 06:44:18,561 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 06:44:18,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:18,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:18,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156568618] [2022-07-14 06:44:18,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156568618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:18,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:18,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:44:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764618723] [2022-07-14 06:44:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:18,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:44:18,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:44:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:18,562 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:18,861 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-14 06:44:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:18,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:44:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:18,862 INFO L225 Difference]: With dead ends: 97 [2022-07-14 06:44:18,862 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:44:18,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:44:18,862 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:18,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 277 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2022-07-14 06:44:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:44:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-07-14 06:44:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 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 06:44:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-14 06:44:18,865 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 15 [2022-07-14 06:44:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:18,865 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-14 06:44:18,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-14 06:44:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:44:18,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:18,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:18,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:19,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash -929437395, now seen corresponding path program 1 times [2022-07-14 06:44:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067583912] [2022-07-14 06:44:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:19,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:19,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:44:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:19,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 06:44:19,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:19,158 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 06:44:19,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:19,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:19,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:19,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:19,362 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-14 06:44:19,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2022-07-14 06:44:19,370 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:44:19,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 29 [2022-07-14 06:44:19,418 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 06:44:19,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:19,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:19,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067583912] [2022-07-14 06:44:19,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067583912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:19,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:19,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:44:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401469623] [2022-07-14 06:44:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:19,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:44:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:44:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:44:19,420 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:19,710 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-14 06:44:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:44:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:44:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:19,711 INFO L225 Difference]: With dead ends: 96 [2022-07-14 06:44:19,711 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 06:44:19,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:19,712 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:19,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 276 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2022-07-14 06:44:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 06:44:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-07-14 06:44:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 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 06:44:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-07-14 06:44:19,714 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 15 [2022-07-14 06:44:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:19,714 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-07-14 06:44:19,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-07-14 06:44:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:44:19,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:19,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:19,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:19,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:19,915 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash -448678999, now seen corresponding path program 1 times [2022-07-14 06:44:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929892920] [2022-07-14 06:44:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:19,917 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:19,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:44:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:19,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:44:19,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:19,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:20,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:44:20,018 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 06:44:20,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:20,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:20,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929892920] [2022-07-14 06:44:20,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929892920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:20,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:20,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:44:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275302438] [2022-07-14 06:44:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:20,020 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:20,200 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-07-14 06:44:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:44:20,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:44:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:20,200 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:44:20,201 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:44:20,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:20,201 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:20,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 294 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:44:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-07-14 06:44:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 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 06:44:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-14 06:44:20,203 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 15 [2022-07-14 06:44:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:20,203 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-14 06:44:20,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-14 06:44:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:44:20,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:20,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:20,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:20,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:20,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196987, now seen corresponding path program 1 times [2022-07-14 06:44:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741373424] [2022-07-14 06:44:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:20,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:20,406 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:20,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:44:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:20,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:44:20,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:20,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:44:20,506 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 06:44:20,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:20,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:20,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741373424] [2022-07-14 06:44:20,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741373424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:20,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:20,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:44:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43423858] [2022-07-14 06:44:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:20,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:44:20,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:20,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:44:20,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:44:20,508 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:20,882 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2022-07-14 06:44:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:20,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:44:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:20,883 INFO L225 Difference]: With dead ends: 127 [2022-07-14 06:44:20,883 INFO L226 Difference]: Without dead ends: 127 [2022-07-14 06:44:20,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:20,884 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 172 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:20,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 162 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:44:20,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-14 06:44:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2022-07-14 06:44:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 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 06:44:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-07-14 06:44:20,885 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 16 [2022-07-14 06:44:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:20,886 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-07-14 06:44:20,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-07-14 06:44:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:44:20,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:20,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:20,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:21,095 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196988, now seen corresponding path program 1 times [2022-07-14 06:44:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862001159] [2022-07-14 06:44:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:21,099 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:21,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:44:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:21,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:44:21,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:21,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:44:21,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-14 06:44:21,295 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 06:44:21,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:21,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862001159] [2022-07-14 06:44:21,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862001159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:21,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:21,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:44:21,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777489889] [2022-07-14 06:44:21,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:21,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:44:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:44:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:44:21,296 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:22,084 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-07-14 06:44:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:44:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:22,085 INFO L225 Difference]: With dead ends: 126 [2022-07-14 06:44:22,085 INFO L226 Difference]: Without dead ends: 126 [2022-07-14 06:44:22,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:44:22,086 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:22,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 177 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:44:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-14 06:44:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2022-07-14 06:44:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 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 06:44:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-14 06:44:22,088 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 16 [2022-07-14 06:44:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:22,088 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-14 06:44:22,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-14 06:44:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:44:22,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:22,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:22,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:22,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:22,294 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 770466058, now seen corresponding path program 1 times [2022-07-14 06:44:22,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:22,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634837897] [2022-07-14 06:44:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:22,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:22,301 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:22,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:44:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:22,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:44:22,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:22,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:22,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:22,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:22,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:22,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:22,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:22,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:22,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:22,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:22,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:22,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:22,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:22,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:22,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:44:22,509 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 06:44:22,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:22,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:22,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634837897] [2022-07-14 06:44:22,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634837897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:22,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:22,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:44:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031462118] [2022-07-14 06:44:22,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:22,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:44:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:44:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:44:22,511 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 06:44:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:22,857 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-14 06:44:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:22,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:44:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:22,858 INFO L225 Difference]: With dead ends: 132 [2022-07-14 06:44:22,858 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:44:22,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:44:22,859 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 205 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:22,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 344 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:44:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:44:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2022-07-14 06:44:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 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 06:44:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-07-14 06:44:22,861 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2022-07-14 06:44:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:22,861 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-07-14 06:44:22,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 06:44:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-07-14 06:44:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:44:22,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:22,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:22,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:23,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:23,073 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1441667505, now seen corresponding path program 1 times [2022-07-14 06:44:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:23,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366616284] [2022-07-14 06:44:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:23,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:23,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:23,075 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:23,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:44:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:23,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:44:23,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:23,133 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 06:44:23,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:23,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366616284] [2022-07-14 06:44:23,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366616284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:23,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:23,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:44:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078884683] [2022-07-14 06:44:23,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:23,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:44:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:44:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:23,134 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) 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 06:44:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:23,140 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-07-14 06:44:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:44:23,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) 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 19 [2022-07-14 06:44:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:23,140 INFO L225 Difference]: With dead ends: 92 [2022-07-14 06:44:23,140 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 06:44:23,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 06:44:23,141 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:23,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:44:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 06:44:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-14 06:44:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 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 06:44:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-07-14 06:44:23,142 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 19 [2022-07-14 06:44:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:23,143 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-07-14 06:44:23,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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 06:44:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-07-14 06:44:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:44:23,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:23,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:23,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:23,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:23,343 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash -740864340, now seen corresponding path program 1 times [2022-07-14 06:44:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:23,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803764422] [2022-07-14 06:44:23,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:23,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:23,345 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:23,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:44:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:23,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:44:23,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:23,423 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 06:44:23,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:23,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:23,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803764422] [2022-07-14 06:44:23,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803764422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:23,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:23,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:44:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036355979] [2022-07-14 06:44:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:23,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:44:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:44:23,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:44:23,424 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) 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 06:44:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:23,442 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-07-14 06:44:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:44:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) 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 19 [2022-07-14 06:44:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:23,444 INFO L225 Difference]: With dead ends: 158 [2022-07-14 06:44:23,444 INFO L226 Difference]: Without dead ends: 158 [2022-07-14 06:44:23,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 06:44:23,444 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:23,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 141 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:44:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-14 06:44:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-07-14 06:44:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 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 06:44:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-14 06:44:23,447 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 19 [2022-07-14 06:44:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:23,447 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-14 06:44:23,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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 06:44:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-07-14 06:44:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:44:23,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:23,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:23,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-14 06:44:23,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:23,656 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972818, now seen corresponding path program 1 times [2022-07-14 06:44:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:23,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71256114] [2022-07-14 06:44:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:23,658 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:23,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:44:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:23,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:44:23,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:23,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:44:23,745 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 06:44:23,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:23,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71256114] [2022-07-14 06:44:23,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71256114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:23,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:23,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:44:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270445139] [2022-07-14 06:44:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:23,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:44:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:23,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:44:23,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:44:23,749 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:23,915 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-07-14 06:44:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:44:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-14 06:44:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:23,916 INFO L225 Difference]: With dead ends: 102 [2022-07-14 06:44:23,916 INFO L226 Difference]: Without dead ends: 102 [2022-07-14 06:44:23,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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 06:44:23,916 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:23,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:44:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-14 06:44:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-14 06:44:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 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 06:44:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-07-14 06:44:23,918 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2022-07-14 06:44:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:23,918 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-07-14 06:44:23,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-07-14 06:44:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:44:23,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:23,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:23,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:24,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:24,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:24,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972817, now seen corresponding path program 1 times [2022-07-14 06:44:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854043220] [2022-07-14 06:44:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:24,128 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:24,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 06:44:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:24,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:44:24,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:24,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:44:24,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-14 06:44:24,298 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 06:44:24,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:24,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854043220] [2022-07-14 06:44:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854043220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:24,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:24,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:44:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939241406] [2022-07-14 06:44:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:44:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:44:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:44:24,299 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:24,640 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-14 06:44:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:44:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-14 06:44:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:24,641 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:44:24,641 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:44:24,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:44:24,641 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 24 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:24,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:44:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:44:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-14 06:44:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 states have internal predecessors, (112), 0 states have call successors, (0), 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 06:44:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2022-07-14 06:44:24,643 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 20 [2022-07-14 06:44:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:24,644 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2022-07-14 06:44:24,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 06:44:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-07-14 06:44:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:44:24,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:24,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:24,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-14 06:44:24,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:24,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1226162375, now seen corresponding path program 1 times [2022-07-14 06:44:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:24,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113408641] [2022-07-14 06:44:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:24,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:24,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:24,852 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:24,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:44:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:24,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:44:24,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:24,947 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 06:44:24,981 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:44:24,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:44:25,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:25,082 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:25,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-14 06:44:25,104 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:25,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-14 06:44:25,137 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:25,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:44:25,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:44:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:25,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:25,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:44:25,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:44:25,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:44:25,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:25,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-14 06:44:25,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:25,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-14 06:44:25,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-14 06:44:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-14 06:44:25,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113408641] [2022-07-14 06:44:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113408641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:25,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:44:25,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-14 06:44:25,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677327609] [2022-07-14 06:44:25,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:25,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 06:44:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 06:44:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-07-14 06:44:25,382 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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 06:44:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:26,030 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-07-14 06:44:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:44:26,031 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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 21 [2022-07-14 06:44:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:26,031 INFO L225 Difference]: With dead ends: 198 [2022-07-14 06:44:26,031 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 06:44:26,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=290, Unknown=3, NotChecked=114, Total=506 [2022-07-14 06:44:26,032 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 209 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:26,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 509 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 443 Invalid, 0 Unknown, 520 Unchecked, 0.5s Time] [2022-07-14 06:44:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 06:44:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 120. [2022-07-14 06:44:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 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 06:44:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2022-07-14 06:44:26,035 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 21 [2022-07-14 06:44:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:26,035 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2022-07-14 06:44:26,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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 06:44:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-07-14 06:44:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:44:26,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:26,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:26,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:26,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:26,244 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 960368175, now seen corresponding path program 1 times [2022-07-14 06:44:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:26,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028092328] [2022-07-14 06:44:26,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:26,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:26,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:26,245 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:44:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:26,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:44:26,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:26,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:44:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:26,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:26,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028092328] [2022-07-14 06:44:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028092328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:26,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:26,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:44:26,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708771919] [2022-07-14 06:44:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:26,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:26,347 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:26,573 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-14 06:44:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:44:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:44:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:26,574 INFO L225 Difference]: With dead ends: 122 [2022-07-14 06:44:26,574 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:44:26,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:26,574 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:26,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 139 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:44:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:44:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-14 06:44:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 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 06:44:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-07-14 06:44:26,577 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 22 [2022-07-14 06:44:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:26,577 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-07-14 06:44:26,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-07-14 06:44:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:44:26,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:26,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:26,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:26,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:26,789 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 960368176, now seen corresponding path program 1 times [2022-07-14 06:44:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:26,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335246810] [2022-07-14 06:44:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:26,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:26,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:26,790 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:26,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:44:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:26,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:44:26,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:26,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:44:26,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-14 06:44:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:26,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:26,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:26,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335246810] [2022-07-14 06:44:26,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335246810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:26,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:26,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:44:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78173594] [2022-07-14 06:44:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:26,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:44:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:44:26,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:44:26,988 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:27,575 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-14 06:44:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:44:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:44:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:27,576 INFO L225 Difference]: With dead ends: 122 [2022-07-14 06:44:27,576 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:44:27,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:44:27,577 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 57 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:27,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:44:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:44:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-14 06:44:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 120 states have internal predecessors, (135), 0 states have call successors, (0), 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 06:44:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2022-07-14 06:44:27,580 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 22 [2022-07-14 06:44:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:27,580 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2022-07-14 06:44:27,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2022-07-14 06:44:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:44:27,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:27,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:27,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:27,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:27,785 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash -643667878, now seen corresponding path program 1 times [2022-07-14 06:44:27,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:27,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999065128] [2022-07-14 06:44:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:27,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:27,787 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:27,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:44:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:27,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:44:27,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:27,877 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 06:44:27,914 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:44:27,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 06:44:27,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:28,027 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:28,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:44:28,051 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:28,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:44:28,101 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:28,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:44:28,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:44:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:28,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:28,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:44:28,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:28,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 06:44:28,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:28,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-14 06:44:28,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 06:44:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:40,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:40,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999065128] [2022-07-14 06:44:40,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999065128] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:40,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:44:40,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-14 06:44:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052119389] [2022-07-14 06:44:40,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:44:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:40,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:44:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=265, Unknown=7, NotChecked=34, Total=380 [2022-07-14 06:44:40,305 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:40,564 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-07-14 06:44:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:44:40,565 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:44:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:40,565 INFO L225 Difference]: With dead ends: 123 [2022-07-14 06:44:40,565 INFO L226 Difference]: Without dead ends: 123 [2022-07-14 06:44:40,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=124, Invalid=379, Unknown=7, NotChecked=42, Total=552 [2022-07-14 06:44:40,566 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 49 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:40,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 432 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 304 Unchecked, 0.2s Time] [2022-07-14 06:44:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-14 06:44:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-14 06:44:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 122 states have internal predecessors, (138), 0 states have call successors, (0), 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 06:44:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2022-07-14 06:44:40,568 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 22 [2022-07-14 06:44:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:40,568 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2022-07-14 06:44:40,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2022-07-14 06:44:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:44:40,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:40,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:40,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:40,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:40,776 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash -643667877, now seen corresponding path program 1 times [2022-07-14 06:44:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:40,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439357692] [2022-07-14 06:44:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:40,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:40,779 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:44:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:40,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:44:40,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:40,884 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 06:44:40,917 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 06:44:40,929 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:44:40,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:44:40,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:40,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:41,049 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:41,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:44:41,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:41,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-07-14 06:44:41,089 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:44:41,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:44:41,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:44:41,108 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:41,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:44:41,155 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:41,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:44:41,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 20 [2022-07-14 06:44:41,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:44:41,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-14 06:44:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:41,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:41,392 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 06:44:41,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 06:44:41,478 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_618) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_617) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_618) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2022-07-14 06:44:41,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:41,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-07-14 06:44:41,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:41,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-14 06:44:41,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:44:41,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:41,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-14 06:44:41,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:41,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:44:41,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:41,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-14 06:44:41,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:41,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-14 06:44:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-14 06:44:41,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439357692] [2022-07-14 06:44:41,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439357692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:41,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:44:41,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-14 06:44:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5574586] [2022-07-14 06:44:41,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:41,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 06:44:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 06:44:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-14 06:44:41,689 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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 06:44:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:43,863 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2022-07-14 06:44:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:44:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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 22 [2022-07-14 06:44:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:43,864 INFO L225 Difference]: With dead ends: 192 [2022-07-14 06:44:43,865 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 06:44:43,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=616, Unknown=3, NotChecked=162, Total=930 [2022-07-14 06:44:43,865 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 254 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:43,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 393 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 495 Invalid, 0 Unknown, 355 Unchecked, 1.1s Time] [2022-07-14 06:44:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 06:44:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2022-07-14 06:44:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.311926605504587) internal successors, (143), 125 states have internal predecessors, (143), 0 states have call successors, (0), 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 06:44:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2022-07-14 06:44:43,868 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 22 [2022-07-14 06:44:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:43,868 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2022-07-14 06:44:43,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 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 06:44:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2022-07-14 06:44:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:44:43,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:43,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:43,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-14 06:44:44,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:44,076 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash 977716951, now seen corresponding path program 1 times [2022-07-14 06:44:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:44,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248444483] [2022-07-14 06:44:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:44,078 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:44,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:44:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:44,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:44:44,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:44,181 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 06:44:44,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:44,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:44,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:44,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-07-14 06:44:44,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:48,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:48,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:48,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:48,762 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:44:48,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2022-07-14 06:44:48,770 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:44:48,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 36 [2022-07-14 06:44:48,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:48,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:48,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-07-14 06:44:48,909 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 06:44:48,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:48,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:48,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248444483] [2022-07-14 06:44:48,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248444483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:48,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:48,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 06:44:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4873970] [2022-07-14 06:44:48,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:48,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:44:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:44:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=147, Unknown=2, NotChecked=0, Total=182 [2022-07-14 06:44:48,911 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:49,342 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2022-07-14 06:44:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:44:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:44:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:49,343 INFO L225 Difference]: With dead ends: 136 [2022-07-14 06:44:49,343 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 06:44:49,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=57, Invalid=247, Unknown=2, NotChecked=0, Total=306 [2022-07-14 06:44:49,344 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:49,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 433 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 132 Unchecked, 0.3s Time] [2022-07-14 06:44:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 06:44:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2022-07-14 06:44:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 131 states have internal predecessors, (150), 0 states have call successors, (0), 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 06:44:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2022-07-14 06:44:49,346 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 23 [2022-07-14 06:44:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:49,346 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2022-07-14 06:44:49,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2022-07-14 06:44:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:44:49,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:49,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:49,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:49,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:49,553 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -504150028, now seen corresponding path program 1 times [2022-07-14 06:44:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678917318] [2022-07-14 06:44:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:49,556 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 06:44:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:49,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:44:49,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:49,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-14 06:44:49,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-14 06:44:49,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:44:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:49,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:44:49,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:44:49,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678917318] [2022-07-14 06:44:49,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678917318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:44:49,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:44:49,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:44:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473220540] [2022-07-14 06:44:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:44:49,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:44:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:44:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:44:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:44:49,731 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:50,203 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2022-07-14 06:44:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:44:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:44:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:50,204 INFO L225 Difference]: With dead ends: 143 [2022-07-14 06:44:50,204 INFO L226 Difference]: Without dead ends: 143 [2022-07-14 06:44:50,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:44:50,205 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:50,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 283 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:44:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-14 06:44:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2022-07-14 06:44:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 139 states have internal predecessors, (159), 0 states have call successors, (0), 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 06:44:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2022-07-14 06:44:50,207 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 24 [2022-07-14 06:44:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:50,207 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2022-07-14 06:44:50,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:44:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2022-07-14 06:44:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:44:50,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:50,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:50,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-14 06:44:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:44:50,408 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-14 06:44:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1519298741, now seen corresponding path program 1 times [2022-07-14 06:44:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:44:50,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678211643] [2022-07-14 06:44:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:50,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:44:50,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:44:50,410 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:44:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 06:44:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:50,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:44:50,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:50,533 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:44:50,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-14 06:44:50,594 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-14 06:44:50,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 29 [2022-07-14 06:44:50,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:44:50,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:44:50,702 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:44:50,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-14 06:44:50,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-07-14 06:44:50,759 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:44:50,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-14 06:44:50,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-07-14 06:44:50,831 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-14 06:44:50,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 48 [2022-07-14 06:44:50,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 28 [2022-07-14 06:44:50,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:44:50,979 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:44:50,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-07-14 06:44:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:50,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:51,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_718 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_718)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (_ bv1 1)))) is different from false [2022-07-14 06:44:51,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_718 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_718)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (_ bv1 1)))) is different from false [2022-07-14 06:44:51,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_718 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem4#1.offset|) v_ArrVal_718)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-07-14 06:44:51,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_718 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) .cse2) v_ArrVal_718))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (_ bv1 1)))) is different from false [2022-07-14 06:44:51,395 INFO L356 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2022-07-14 06:44:51,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 57479 treesize of output 54685 [2022-07-14 06:44:53,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:53,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 51462 treesize of output 51316 [2022-07-14 06:44:53,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56881 treesize of output 56373 [2022-07-14 06:44:54,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:54,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56373 treesize of output 48965 [2022-07-14 06:44:54,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48957 treesize of output 48449