./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 6c24879c 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-?-6c24879 [2022-07-12 19:03:17,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:03:17,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:03:17,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:03:17,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:03:17,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:03:17,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:03:17,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:03:17,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:03:17,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:03:17,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:03:17,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:03:17,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:03:17,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:03:17,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:03:17,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:03:17,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:03:17,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:03:17,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:03:17,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:03:17,789 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:03:17,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:03:17,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:03:17,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:03:17,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:03:17,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:03:17,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:03:17,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:03:17,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:03:17,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:03:17,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:03:17,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:03:17,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:03:17,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:03:17,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:03:17,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:03:17,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:03:17,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:03:17,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:03:17,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:03:17,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:03:17,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:03:17,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:03:17,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:03:17,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:03:17,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:03:17,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:03:17,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:03:17,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:03:17,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:03:17,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:03:17,848 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:03:17,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:03:17,849 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:03:17,849 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:03:17,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:03:17,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:03:17,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:03:17,850 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:03:17,850 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:03:17,850 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:03:17,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:03:17,851 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:03:17,851 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:03:17,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:03:17,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:03:17,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:03:17,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:03:17,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:17,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:03:17,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:03:17,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:03:17,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:03:17,853 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-12 19:03:18,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:03:18,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:03:18,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:03:18,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:03:18,082 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:03:18,083 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-12 19:03:18,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1b50961/d7c749b1b76743c49b12c057a1215f69/FLAG1bf547115 [2022-07-12 19:03:18,607 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:03:18,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-07-12 19:03:18,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1b50961/d7c749b1b76743c49b12c057a1215f69/FLAG1bf547115 [2022-07-12 19:03:18,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1b50961/d7c749b1b76743c49b12c057a1215f69 [2022-07-12 19:03:18,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:03:18,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:03:18,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:18,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:03:18,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:03:18,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:18" (1/1) ... [2022-07-12 19:03:18,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6017cf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:18, skipping insertion in model container [2022-07-12 19:03:18,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:18" (1/1) ... [2022-07-12 19:03:18,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:03:19,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:03:19,222 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-12 19:03:19,228 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-12 19:03:19,231 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-12 19:03:19,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:19,249 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:03:19,288 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-12 19:03:19,299 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-12 19:03:19,300 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-12 19:03:19,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:19,327 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:03:19,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19 WrapperNode [2022-07-12 19:03:19,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:19,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:19,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:03:19,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:03:19,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,368 INFO L137 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-07-12 19:03:19,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:19,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:03:19,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:03:19,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:03:19,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:03:19,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:03:19,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:03:19,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:03:19,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (1/1) ... [2022-07-12 19:03:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:19,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:19,432 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-12 19:03:19,433 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-12 19:03:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:03:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:03:19,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:03:19,536 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:03:19,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:03:19,823 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:03:19,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:03:19,829 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-12 19:03:19,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:19 BoogieIcfgContainer [2022-07-12 19:03:19,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:03:19,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:03:19,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:03:19,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:03:19,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:03:18" (1/3) ... [2022-07-12 19:03:19,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a1451c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:19, skipping insertion in model container [2022-07-12 19:03:19,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:19" (2/3) ... [2022-07-12 19:03:19,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a1451c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:19, skipping insertion in model container [2022-07-12 19:03:19,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:19" (3/3) ... [2022-07-12 19:03:19,838 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2022-07-12 19:03:19,849 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:03:19,849 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-07-12 19:03:19,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:03:19,893 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@59494b47, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1712639 [2022-07-12 19:03:19,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-07-12 19:03:19,896 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-12 19:03:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:19,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:19,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:19,902 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-12 19:03:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:03:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:19,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235149797] [2022-07-12 19:03:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:20,061 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-12 19:03:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:20,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235149797] [2022-07-12 19:03:20,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235149797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:20,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:20,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222285631] [2022-07-12 19:03:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:20,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:20,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:20,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:20,099 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-12 19:03:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:20,215 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-07-12 19:03:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:20,217 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-12 19:03:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:20,224 INFO L225 Difference]: With dead ends: 108 [2022-07-12 19:03:20,224 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 19:03:20,226 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-12 19:03:20,229 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-12 19:03:20,230 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-12 19:03:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 19:03:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2022-07-12 19:03:20,268 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-12 19:03:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-12 19:03:20,272 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 3 [2022-07-12 19:03:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:20,272 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-12 19:03:20,273 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-12 19:03:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-12 19:03:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:20,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:20,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:03:20,274 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-12 19:03:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:03:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:20,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518766356] [2022-07-12 19:03:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:20,349 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-12 19:03:20,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:20,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518766356] [2022-07-12 19:03:20,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518766356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:20,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:20,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940679357] [2022-07-12 19:03:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:20,353 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-12 19:03:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:20,426 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-12 19:03:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:20,427 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-12 19:03:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:20,430 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:03:20,430 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:03:20,431 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-12 19:03:20,433 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 19:03:20,433 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-12 19:03:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:03:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-07-12 19:03:20,444 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-12 19:03:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-12 19:03:20,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2022-07-12 19:03:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:20,449 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-12 19:03:20,449 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-12 19:03:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-12 19:03:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:03:20,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:20,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:20,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:03:20,451 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-12 19:03:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2022-07-12 19:03:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:20,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743402889] [2022-07-12 19:03:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:20,521 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-12 19:03:20,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:20,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743402889] [2022-07-12 19:03:20,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743402889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:20,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:20,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827498556] [2022-07-12 19:03:20,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:20,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:20,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:20,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:20,525 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-12 19:03:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:20,629 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-12 19:03:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:20,629 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-12 19:03:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:20,632 INFO L225 Difference]: With dead ends: 90 [2022-07-12 19:03:20,633 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 19:03:20,633 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-12 19:03:20,635 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 19:03:20,635 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-12 19:03:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 19:03:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2022-07-12 19:03:20,645 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-12 19:03:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-12 19:03:20,647 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 8 [2022-07-12 19:03:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:20,648 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-12 19:03:20,648 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-12 19:03:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-12 19:03:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:03:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:20,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:20,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:03:20,649 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-12 19:03:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 59263653, now seen corresponding path program 1 times [2022-07-12 19:03:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:20,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544698050] [2022-07-12 19:03:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:20,715 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-12 19:03:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:20,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544698050] [2022-07-12 19:03:20,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544698050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:20,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:20,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638508795] [2022-07-12 19:03:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:20,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:20,718 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-12 19:03:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:20,829 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-07-12 19:03:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:03:20,830 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-12 19:03:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:20,830 INFO L225 Difference]: With dead ends: 101 [2022-07-12 19:03:20,830 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 19:03:20,831 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-12 19:03:20,832 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-12 19:03:20,832 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-12 19:03:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 19:03:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2022-07-12 19:03:20,836 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-12 19:03:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-12 19:03:20,837 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 8 [2022-07-12 19:03:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-12 19:03:20,837 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-12 19:03:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-12 19:03:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:20,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:20,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:20,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:03:20,838 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-12 19:03:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 460324999, now seen corresponding path program 1 times [2022-07-12 19:03:20,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:20,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841943400] [2022-07-12 19:03:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:20,999 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-12 19:03:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:21,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841943400] [2022-07-12 19:03:21,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841943400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:21,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:21,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759911932] [2022-07-12 19:03:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:21,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:21,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:21,002 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-12 19:03:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:21,213 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-07-12 19:03:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:21,213 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-12 19:03:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:21,214 INFO L225 Difference]: With dead ends: 170 [2022-07-12 19:03:21,214 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 19:03:21,215 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-12 19:03:21,217 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-12 19:03:21,218 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-12 19:03:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 19:03:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 90. [2022-07-12 19:03:21,228 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-12 19:03:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-07-12 19:03:21,228 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2022-07-12 19:03:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:21,228 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-07-12 19:03:21,229 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-12 19:03:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-07-12 19:03:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:21,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:21,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:21,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:03:21,230 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-12 19:03:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-12 19:03:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:21,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282944158] [2022-07-12 19:03:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:21,300 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-12 19:03:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:21,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282944158] [2022-07-12 19:03:21,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282944158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:21,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:21,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:21,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282981960] [2022-07-12 19:03:21,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:21,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:21,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:21,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:21,302 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-12 19:03:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:21,451 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-07-12 19:03:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:21,452 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-12 19:03:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:21,452 INFO L225 Difference]: With dead ends: 89 [2022-07-12 19:03:21,453 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 19:03:21,453 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-12 19:03:21,455 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-12 19:03:21,457 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-12 19:03:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 19:03:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-12 19:03:21,467 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-12 19:03:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-07-12 19:03:21,468 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2022-07-12 19:03:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:21,469 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-07-12 19:03:21,469 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-12 19:03:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-07-12 19:03:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:21,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:21,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:21,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:03:21,470 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-12 19:03:21,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-12 19:03:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:21,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082781148] [2022-07-12 19:03:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:21,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-12 19:03:21,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:21,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082781148] [2022-07-12 19:03:21,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082781148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:21,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:21,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230711345] [2022-07-12 19:03:21,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:21,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:21,565 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-12 19:03:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:21,755 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-07-12 19:03:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:21,755 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-12 19:03:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:21,756 INFO L225 Difference]: With dead ends: 85 [2022-07-12 19:03:21,756 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 19:03:21,756 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-12 19:03:21,757 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-12 19:03:21,757 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-12 19:03:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 19:03:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-12 19:03:21,759 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-12 19:03:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-07-12 19:03:21,759 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 12 [2022-07-12 19:03:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:21,760 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-07-12 19:03:21,760 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-12 19:03:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-07-12 19:03:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:03:21,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:21,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:21,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:03:21,761 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-12 19:03:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177244, now seen corresponding path program 1 times [2022-07-12 19:03:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:21,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226013365] [2022-07-12 19:03:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:21,850 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-12 19:03:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:21,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226013365] [2022-07-12 19:03:21,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226013365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:21,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:21,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201482187] [2022-07-12 19:03:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:21,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:21,852 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-12 19:03:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:22,074 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-07-12 19:03:22,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:22,074 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-12 19:03:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:22,075 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:03:22,075 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:03:22,075 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-12 19:03:22,076 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-12 19:03:22,076 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-12 19:03:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:03:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2022-07-12 19:03:22,077 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-12 19:03:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-07-12 19:03:22,078 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 13 [2022-07-12 19:03:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:22,078 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-07-12 19:03:22,078 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-12 19:03:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-07-12 19:03:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:03:22,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:22,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:22,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:03:22,079 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-12 19:03:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177245, now seen corresponding path program 1 times [2022-07-12 19:03:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:22,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719116753] [2022-07-12 19:03:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,232 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-12 19:03:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719116753] [2022-07-12 19:03:22,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719116753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:22,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:22,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381152532] [2022-07-12 19:03:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:22,235 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-12 19:03:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:22,485 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-07-12 19:03:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:22,485 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-12 19:03:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:22,486 INFO L225 Difference]: With dead ends: 158 [2022-07-12 19:03:22,486 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 19:03:22,486 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-12 19:03:22,487 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:22,487 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.2s Time] [2022-07-12 19:03:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 19:03:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2022-07-12 19:03:22,489 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-12 19:03:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-07-12 19:03:22,489 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 13 [2022-07-12 19:03:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:22,490 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-07-12 19:03:22,490 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-12 19:03:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-07-12 19:03:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:22,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:22,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:22,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:03:22,490 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-12 19:03:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -230426379, now seen corresponding path program 1 times [2022-07-12 19:03:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014094356] [2022-07-12 19:03:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,590 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-12 19:03:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014094356] [2022-07-12 19:03:22,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014094356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:22,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:22,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85093297] [2022-07-12 19:03:22,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:22,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:22,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:22,593 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-12 19:03:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:22,876 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-07-12 19:03:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:22,877 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-12 19:03:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:22,877 INFO L225 Difference]: With dead ends: 143 [2022-07-12 19:03:22,877 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 19:03:22,877 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-12 19:03:22,878 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:22,878 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.2s Time] [2022-07-12 19:03:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 19:03:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2022-07-12 19:03:22,880 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-12 19:03:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-12 19:03:22,880 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 16 [2022-07-12 19:03:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:22,880 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-12 19:03:22,880 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-12 19:03:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-12 19:03:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:22,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:22,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:22,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:03:22,881 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-12 19:03:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -230426378, now seen corresponding path program 1 times [2022-07-12 19:03:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:22,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940379033] [2022-07-12 19:03:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,037 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-12 19:03:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940379033] [2022-07-12 19:03:23,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940379033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449553093] [2022-07-12 19:03:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:23,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:23,040 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-12 19:03:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,299 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-12 19:03:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:23,300 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-12 19:03:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,300 INFO L225 Difference]: With dead ends: 153 [2022-07-12 19:03:23,300 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:03:23,301 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-12 19:03:23,301 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 216 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,301 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.2s Time] [2022-07-12 19:03:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:03:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2022-07-12 19:03:23,303 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-12 19:03:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-12 19:03:23,304 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 16 [2022-07-12 19:03:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,304 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-12 19:03:23,304 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-12 19:03:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-12 19:03:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:23,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:03:23,306 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-12 19:03:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702036, now seen corresponding path program 1 times [2022-07-12 19:03:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580621791] [2022-07-12 19:03:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,370 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-12 19:03:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580621791] [2022-07-12 19:03:23,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580621791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125139085] [2022-07-12 19:03:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:23,372 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-12 19:03:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,591 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-07-12 19:03:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:23,592 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-12 19:03:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,593 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:03:23,593 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:03:23,593 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-12 19:03:23,593 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,594 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.2s Time] [2022-07-12 19:03:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:03:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2022-07-12 19:03:23,596 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-12 19:03:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-07-12 19:03:23,596 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 17 [2022-07-12 19:03:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,596 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-07-12 19:03:23,596 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-12 19:03:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-07-12 19:03:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:23,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:03:23,597 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-12 19:03:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702037, now seen corresponding path program 1 times [2022-07-12 19:03:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057932699] [2022-07-12 19:03:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,740 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-12 19:03:23,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057932699] [2022-07-12 19:03:23,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057932699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073247535] [2022-07-12 19:03:23,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:23,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:23,742 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-12 19:03:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,951 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-07-12 19:03:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:23,952 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-12 19:03:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,953 INFO L225 Difference]: With dead ends: 152 [2022-07-12 19:03:23,953 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 19:03:23,953 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-12 19:03:23,954 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,954 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.2s Time] [2022-07-12 19:03:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 19:03:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2022-07-12 19:03:23,956 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-12 19:03:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2022-07-12 19:03:23,957 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 17 [2022-07-12 19:03:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,957 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2022-07-12 19:03:23,957 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-12 19:03:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2022-07-12 19:03:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:23,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:03:23,958 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-12 19:03:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1499460812, now seen corresponding path program 1 times [2022-07-12 19:03:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242447150] [2022-07-12 19:03:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,997 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-12 19:03:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242447150] [2022-07-12 19:03:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242447150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308452479] [2022-07-12 19:03:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:24,000 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-12 19:03:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,101 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-07-12 19:03:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:24,102 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-12 19:03:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,102 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:03:24,102 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:03:24,103 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-12 19:03:24,103 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,103 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.1s Time] [2022-07-12 19:03:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:03:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2022-07-12 19:03:24,105 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-12 19:03:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-07-12 19:03:24,106 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2022-07-12 19:03:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,106 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-07-12 19:03:24,106 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-12 19:03:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-07-12 19:03:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:24,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,107 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-12 19:03:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:03:24,107 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-12 19:03:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1296321320, now seen corresponding path program 1 times [2022-07-12 19:03:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411727581] [2022-07-12 19:03:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,206 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-12 19:03:24,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411727581] [2022-07-12 19:03:24,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411727581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739050267] [2022-07-12 19:03:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:24,208 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-12 19:03:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,349 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-07-12 19:03:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:24,350 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-12 19:03:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,351 INFO L225 Difference]: With dead ends: 146 [2022-07-12 19:03:24,351 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 19:03:24,351 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-12 19:03:24,351 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-12 19:03:24,352 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-12 19:03:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 19:03:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2022-07-12 19:03:24,354 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-12 19:03:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-07-12 19:03:24,354 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 20 [2022-07-12 19:03:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,355 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-07-12 19:03:24,355 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-12 19:03:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-07-12 19:03:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:24,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,355 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-12 19:03:24,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:03:24,356 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-12 19:03:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -852633064, now seen corresponding path program 1 times [2022-07-12 19:03:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398031691] [2022-07-12 19:03:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,374 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-12 19:03:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398031691] [2022-07-12 19:03:24,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398031691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147013842] [2022-07-12 19:03:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:24,376 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-12 19:03:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,382 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-07-12 19:03:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:24,383 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-12 19:03:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,383 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:03:24,383 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:03:24,384 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-12 19:03:24,384 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-12 19:03:24,385 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-12 19:03:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:03:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 19:03:24,387 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-12 19:03:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2022-07-12 19:03:24,388 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 20 [2022-07-12 19:03:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,388 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2022-07-12 19:03:24,388 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-12 19:03:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-07-12 19:03:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:03:24,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,389 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-12 19:03:24,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:03:24,389 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-12 19:03:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -661774329, now seen corresponding path program 1 times [2022-07-12 19:03:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355500969] [2022-07-12 19:03:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,427 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-12 19:03:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355500969] [2022-07-12 19:03:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355500969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776844262] [2022-07-12 19:03:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:24,430 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-12 19:03:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,511 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-12 19:03:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:24,512 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-12 19:03:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,513 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:03:24,513 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 19:03:24,513 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-12 19:03:24,513 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 19:03:24,514 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-12 19:03:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 19:03:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-12 19:03:24,516 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-12 19:03:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2022-07-12 19:03:24,516 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 21 [2022-07-12 19:03:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,517 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-07-12 19:03:24,517 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-12 19:03:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2022-07-12 19:03:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:03:24,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,520 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-12 19:03:24,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:03:24,521 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-12 19:03:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -661774328, now seen corresponding path program 1 times [2022-07-12 19:03:24,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874279446] [2022-07-12 19:03:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,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-12 19:03:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874279446] [2022-07-12 19:03:24,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874279446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:03:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545321291] [2022-07-12 19:03:24,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:03:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:03:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:24,673 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-12 19:03:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,992 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-07-12 19:03:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:03:24,993 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-12 19:03:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,994 INFO L225 Difference]: With dead ends: 138 [2022-07-12 19:03:24,994 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 19:03:24,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:03:24,995 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 171 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 19:03:24,995 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-12 19:03:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 19:03:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2022-07-12 19:03:24,997 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-12 19:03:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2022-07-12 19:03:24,998 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2022-07-12 19:03:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,998 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2022-07-12 19:03:24,998 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-12 19:03:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2022-07-12 19:03:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:03:24,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,999 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-12 19:03:24,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:03:25,000 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-12 19:03:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2015766217, now seen corresponding path program 1 times [2022-07-12 19:03:25,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177322284] [2022-07-12 19:03:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,022 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-12 19:03:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177322284] [2022-07-12 19:03:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177322284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852105200] [2022-07-12 19:03:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:25,025 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-12 19:03:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,035 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-07-12 19:03:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:25,035 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-12 19:03:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,037 INFO L225 Difference]: With dead ends: 185 [2022-07-12 19:03:25,037 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 19:03:25,038 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-12 19:03:25,038 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-12 19:03:25,038 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-12 19:03:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 19:03:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2022-07-12 19:03:25,047 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-12 19:03:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-07-12 19:03:25,048 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2022-07-12 19:03:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,048 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-07-12 19:03:25,049 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-12 19:03:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-07-12 19:03:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:25,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,049 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-12 19:03:25,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:03:25,050 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-12 19:03:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -224265605, now seen corresponding path program 1 times [2022-07-12 19:03:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250319404] [2022-07-12 19:03:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,224 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-12 19:03:25,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250319404] [2022-07-12 19:03:25,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250319404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:03:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164429846] [2022-07-12 19:03:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:25,226 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-12 19:03:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,468 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-07-12 19:03:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:25,469 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-12 19:03:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,469 INFO L225 Difference]: With dead ends: 149 [2022-07-12 19:03:25,469 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 19:03:25,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:25,470 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-12 19:03:25,470 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-12 19:03:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 19:03:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2022-07-12 19:03:25,473 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-12 19:03:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2022-07-12 19:03:25,473 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 22 [2022-07-12 19:03:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,474 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2022-07-12 19:03:25,474 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-12 19:03:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2022-07-12 19:03:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:03:25,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,474 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-12 19:03:25,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:03:25,474 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-12 19:03:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -350969464, now seen corresponding path program 1 times [2022-07-12 19:03:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270782550] [2022-07-12 19:03:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,509 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-12 19:03:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270782550] [2022-07-12 19:03:25,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270782550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318765599] [2022-07-12 19:03:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:25,512 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-12 19:03:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,634 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-07-12 19:03:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:25,635 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-12 19:03:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,636 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:03:25,636 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:03:25,636 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-12 19:03:25,637 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-12 19:03:25,637 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-12 19:03:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:03:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-07-12 19:03:25,640 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-12 19:03:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-07-12 19:03:25,640 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 23 [2022-07-12 19:03:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,641 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-07-12 19:03:25,641 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-12 19:03:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-07-12 19:03:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:03:25,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,642 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-12 19:03:25,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:03:25,642 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-12 19:03:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash -350969463, now seen corresponding path program 1 times [2022-07-12 19:03:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459315703] [2022-07-12 19:03:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,807 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-12 19:03:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459315703] [2022-07-12 19:03:25,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459315703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705751407] [2022-07-12 19:03:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:25,813 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-12 19:03:25,814 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-12 19:03:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:03:25,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:26,051 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-12 19:03:26,055 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-12 19:03:26,119 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-12 19:03:26,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:26,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705751407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:03:26,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-07-12 19:03:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29362740] [2022-07-12 19:03:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:26,121 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-12 19:03:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,282 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-07-12 19:03:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:26,284 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-12 19:03:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,284 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:03:26,284 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:03:26,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:03:26,285 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-12 19:03:26,285 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-12 19:03:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:03:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-12 19:03:26,287 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-12 19:03:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2022-07-12 19:03:26,288 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 23 [2022-07-12 19:03:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,288 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-07-12 19:03:26,288 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-12 19:03:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2022-07-12 19:03:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:03:26,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,288 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-12 19:03:26,315 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-12 19:03:26,499 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-12 19:03:26,500 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-12 19:03:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1019044192, now seen corresponding path program 1 times [2022-07-12 19:03:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698967024] [2022-07-12 19:03:26,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,643 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-12 19:03:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698967024] [2022-07-12 19:03:26,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698967024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:03:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821321082] [2022-07-12 19:03:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:03:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:03:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:03:26,645 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-12 19:03:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,974 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-07-12 19:03:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:03:26,975 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-12 19:03:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,976 INFO L225 Difference]: With dead ends: 144 [2022-07-12 19:03:26,976 INFO L226 Difference]: Without dead ends: 144 [2022-07-12 19:03:26,976 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-12 19:03:26,976 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,977 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.2s Time] [2022-07-12 19:03:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-12 19:03:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2022-07-12 19:03:26,978 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-12 19:03:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-07-12 19:03:26,980 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 24 [2022-07-12 19:03:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,980 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-12 19:03:26,980 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-12 19:03:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-07-12 19:03:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:03:26,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,982 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-12 19:03:26,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:03:26,982 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-12 19:03:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1710834765, now seen corresponding path program 1 times [2022-07-12 19:03:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695397886] [2022-07-12 19:03:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,128 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-12 19:03:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695397886] [2022-07-12 19:03:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695397886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241219020] [2022-07-12 19:03:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:27,130 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-12 19:03:27,161 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-12 19:03:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 19:03:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:27,240 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-12 19:03:27,310 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:27,311 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-12 19:03:27,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, 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-12 19:03:27,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,442 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-12 19:03:27,468 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,468 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-12 19:03:27,508 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,508 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-12 19:03:27,532 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-12 19:03:27,537 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-12 19:03:27,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:27,552 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-12 19:03:27,603 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-12 19:03:27,608 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-12 19:03:27,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:27,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, 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-12 19:03:27,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:27,623 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-12 19:03:27,626 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-12 19:03:27,742 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-12 19:03:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241219020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:27,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:27,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-07-12 19:03:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383167549] [2022-07-12 19:03:27,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:03:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:03:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=401, Unknown=3, NotChecked=126, Total=600 [2022-07-12 19:03:27,745 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-12 19:03:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:28,522 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2022-07-12 19:03:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:03:28,522 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-12 19:03:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:28,523 INFO L225 Difference]: With dead ends: 235 [2022-07-12 19:03:28,523 INFO L226 Difference]: Without dead ends: 235 [2022-07-12 19:03:28,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=804, Unknown=3, NotChecked=186, Total=1190 [2022-07-12 19:03:28,524 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 220 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:28,525 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.5s Time] [2022-07-12 19:03:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-12 19:03:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 152. [2022-07-12 19:03:28,527 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-12 19:03:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2022-07-12 19:03:28,528 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 24 [2022-07-12 19:03:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:28,528 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2022-07-12 19:03:28,528 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-12 19:03:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-07-12 19:03:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:03:28,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:28,529 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-12 19:03:28,548 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-12 19:03:28,735 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-12 19:03:28,736 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-12 19:03:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2020763981, now seen corresponding path program 1 times [2022-07-12 19:03:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:28,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254471103] [2022-07-12 19:03:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:28,868 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-12 19:03:28,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:28,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254471103] [2022-07-12 19:03:28,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254471103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:28,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055017550] [2022-07-12 19:03:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:28,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:28,872 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-12 19:03:28,873 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-12 19:03:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:28,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:03:28,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:29,038 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-12 19:03:29,041 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-12 19:03:29,071 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-12 19:03:29,085 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-12 19:03:29,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:29,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055017550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:29,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:03:29,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-07-12 19:03:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543012278] [2022-07-12 19:03:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:29,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:03:29,088 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-12 19:03:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:29,318 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2022-07-12 19:03:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:29,319 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-12 19:03:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:29,320 INFO L225 Difference]: With dead ends: 170 [2022-07-12 19:03:29,320 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 19:03:29,320 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-12 19:03:29,321 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-12 19:03:29,321 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-12 19:03:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 19:03:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2022-07-12 19:03:29,324 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-12 19:03:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2022-07-12 19:03:29,325 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 25 [2022-07-12 19:03:29,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:29,325 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2022-07-12 19:03:29,325 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-12 19:03:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2022-07-12 19:03:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:03:29,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:29,326 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-12 19:03:29,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 19:03:29,539 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-12 19:03:29,539 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-12 19:03:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1496266000, now seen corresponding path program 1 times [2022-07-12 19:03:29,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:29,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355667693] [2022-07-12 19:03:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:29,687 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-12 19:03:29,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355667693] [2022-07-12 19:03:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355667693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051900436] [2022-07-12 19:03:29,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:29,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:29,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:29,689 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-12 19:03:29,728 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-12 19:03:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:29,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 19:03:29,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:29,830 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-12 19:03:29,885 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:03:29,885 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-12 19:03:29,922 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-12 19:03:30,016 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:30,017 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-12 19:03:30,077 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:30,078 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-12 19:03:30,123 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:30,123 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-12 19:03:30,153 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-12 19:03:30,208 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-12 19:03:30,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:30,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:03:30,252 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-12 19:03:30,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:30,288 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-12 19:03:30,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:30,293 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-12 19:03:30,296 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-12 19:03:34,470 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-12 19:03:34,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051900436] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:34,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:34,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-07-12 19:03:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233303058] [2022-07-12 19:03:34,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:34,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 19:03:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 19:03:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=441, Unknown=9, NotChecked=90, Total=650 [2022-07-12 19:03:34,472 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-12 19:03:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:34,792 INFO L93 Difference]: Finished difference Result 200 states and 233 transitions. [2022-07-12 19:03:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:03:34,792 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-12 19:03:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:34,793 INFO L225 Difference]: With dead ends: 200 [2022-07-12 19:03:34,793 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 19:03:34,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=223, Invalid=768, Unknown=9, NotChecked=122, Total=1122 [2022-07-12 19:03:34,794 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 126 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:34,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 543 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 269 Invalid, 0 Unknown, 534 Unchecked, 0.2s Time] [2022-07-12 19:03:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 19:03:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 167. [2022-07-12 19:03:34,797 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-12 19:03:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2022-07-12 19:03:34,798 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 25 [2022-07-12 19:03:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:34,798 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2022-07-12 19:03:34,798 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-12 19:03:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2022-07-12 19:03:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:03:34,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:34,798 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-12 19:03:34,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 19:03:35,011 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-12 19:03:35,011 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-12 19:03:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1496265999, now seen corresponding path program 1 times [2022-07-12 19:03:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:35,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566479622] [2022-07-12 19:03:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:35,049 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-12 19:03:35,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 19:03:35,060 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-12 19:03:35,064 INFO L158 Benchmark]: Toolchain (without parser) took 16121.56ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 58.7MB in the beginning and 109.0MB in the end (delta: -50.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:03:35,064 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:03:35,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.84ms. Allocated memory is still 98.6MB. Free memory was 58.5MB in the beginning and 60.3MB in the end (delta: -1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:03:35,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.25ms. Allocated memory is still 98.6MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:03:35,064 INFO L158 Benchmark]: Boogie Preprocessor took 36.18ms. Allocated memory is still 98.6MB. Free memory was 58.1MB in the beginning and 56.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:03:35,065 INFO L158 Benchmark]: RCFGBuilder took 424.77ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.3MB in the beginning and 89.8MB in the end (delta: -33.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-12 19:03:35,065 INFO L158 Benchmark]: TraceAbstraction took 15230.76ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 88.9MB in the beginning and 109.0MB in the end (delta: -20.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-07-12 19:03:35,066 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.84ms. Allocated memory is still 98.6MB. Free memory was 58.5MB in the beginning and 60.3MB in the end (delta: -1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.25ms. Allocated memory is still 98.6MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.18ms. Allocated memory is still 98.6MB. Free memory was 58.1MB in the beginning and 56.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 424.77ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.3MB in the beginning and 89.8MB in the end (delta: -33.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15230.76ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 88.9MB in the beginning and 109.0MB in the end (delta: -20.1MB). Peak memory consumption was 4.8MB. 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-12 19:03:35,099 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-?-6c24879 [2022-07-12 19:03:36,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:03:36,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:03:36,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:03:36,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:03:36,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:03:36,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:03:36,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:03:36,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:03:36,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:03:36,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:03:36,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:03:36,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:03:36,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:03:36,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:03:36,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:03:36,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:03:36,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:03:37,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:03:37,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:03:37,009 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:03:37,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:03:37,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:03:37,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:03:37,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:03:37,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:03:37,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:03:37,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:03:37,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:03:37,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:03:37,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:03:37,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:03:37,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:03:37,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:03:37,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:03:37,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:03:37,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:03:37,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:03:37,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:03:37,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:03:37,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:03:37,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:03:37,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:03:37,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:03:37,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:03:37,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:03:37,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:03:37,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:03:37,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:03:37,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:03:37,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:03:37,073 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:03:37,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:03:37,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:03:37,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:03:37,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:03:37,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:03:37,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:03:37,075 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:03:37,075 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:03:37,075 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:03:37,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:03:37,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:03:37,076 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:03:37,076 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:03:37,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:03:37,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:03:37,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:03:37,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:03:37,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:03:37,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:37,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:03:37,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:03:37,078 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:03:37,078 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:03:37,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:03:37,078 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-12 19:03:37,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:03:37,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:03:37,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:03:37,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:03:37,405 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:03:37,406 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-12 19:03:37,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc91c1b4/c4a45eb283df45daac0158630f876606/FLAG6f5406e5b [2022-07-12 19:03:37,902 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:03:37,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-07-12 19:03:37,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc91c1b4/c4a45eb283df45daac0158630f876606/FLAG6f5406e5b [2022-07-12 19:03:38,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc91c1b4/c4a45eb283df45daac0158630f876606 [2022-07-12 19:03:38,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:03:38,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:03:38,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:38,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:03:38,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:03:38,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adf0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38, skipping insertion in model container [2022-07-12 19:03:38,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:03:38,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:03:38,584 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-12 19:03:38,590 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-12 19:03:38,595 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-12 19:03:38,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:38,626 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:03:38,672 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-12 19:03:38,677 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-12 19:03:38,680 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-12 19:03:38,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:38,710 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:03:38,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38 WrapperNode [2022-07-12 19:03:38,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:38,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:38,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:03:38,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:03:38,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,777 INFO L137 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2022-07-12 19:03:38,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:38,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:03:38,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:03:38,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:03:38,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:03:38,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:03:38,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:03:38,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:03:38,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (1/1) ... [2022-07-12 19:03:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:38,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:38,868 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-12 19:03:38,886 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-12 19:03:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:03:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:03:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:03:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:03:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:03:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:03:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:03:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:03:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:03:38,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:03:38,999 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:03:39,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:03:39,412 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:03:39,419 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:03:39,419 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-12 19:03:39,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:39 BoogieIcfgContainer [2022-07-12 19:03:39,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:03:39,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:03:39,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:03:39,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:03:39,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:03:38" (1/3) ... [2022-07-12 19:03:39,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d367d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:39, skipping insertion in model container [2022-07-12 19:03:39,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:38" (2/3) ... [2022-07-12 19:03:39,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d367d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:39, skipping insertion in model container [2022-07-12 19:03:39,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:39" (3/3) ... [2022-07-12 19:03:39,430 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2022-07-12 19:03:39,442 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:03:39,442 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-07-12 19:03:39,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:03:39,511 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@3ce2e419, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46df4ced [2022-07-12 19:03:39,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-07-12 19:03:39,517 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-12 19:03:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:39,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:39,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:39,525 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-12 19:03:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:03:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:39,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436702508] [2022-07-12 19:03:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:39,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:39,545 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-12 19:03:39,546 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-12 19:03:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:39,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:03:39,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:39,689 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-12 19:03:39,699 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-12 19:03:39,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:39,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436702508] [2022-07-12 19:03:39,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436702508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:39,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:39,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594985122] [2022-07-12 19:03:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:39,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:39,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:39,737 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-12 19:03:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:39,913 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-07-12 19:03:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:39,915 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-12 19:03:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:39,922 INFO L225 Difference]: With dead ends: 106 [2022-07-12 19:03:39,922 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:03:39,923 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-12 19:03:39,926 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:39,926 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.2s Time] [2022-07-12 19:03:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:03:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-07-12 19:03:39,953 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-12 19:03:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-12 19:03:39,955 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 3 [2022-07-12 19:03:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:39,956 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-12 19:03:39,956 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-12 19:03:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-12 19:03:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:39,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:39,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:39,968 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-12 19:03:40,165 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-12 19:03:40,165 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-12 19:03:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:03:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:40,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139104335] [2022-07-12 19:03:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:40,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:40,168 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-12 19:03:40,174 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-12 19:03:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:40,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:03:40,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:40,263 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-12 19:03:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:40,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:40,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:40,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139104335] [2022-07-12 19:03:40,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139104335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:40,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:40,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967522596] [2022-07-12 19:03:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:40,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:40,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:40,282 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-12 19:03:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:40,441 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-12 19:03:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:40,442 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-12 19:03:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:40,443 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:03:40,443 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:03:40,444 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-12 19:03:40,444 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-12 19:03:40,445 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-12 19:03:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:03:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-07-12 19:03:40,450 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-12 19:03:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-07-12 19:03:40,458 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 3 [2022-07-12 19:03:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:40,458 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-07-12 19:03:40,458 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-12 19:03:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-07-12 19:03:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 19:03:40,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:40,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:40,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:40,667 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-12 19:03:40,668 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-12 19:03:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027163, now seen corresponding path program 1 times [2022-07-12 19:03:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:40,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739014693] [2022-07-12 19:03:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:40,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:40,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:40,671 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-12 19:03:40,673 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-12 19:03:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:40,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:03:40,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:40,747 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-12 19:03:40,764 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-12 19:03:40,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:40,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:40,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739014693] [2022-07-12 19:03:40,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739014693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:40,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888141535] [2022-07-12 19:03:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:40,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:40,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:40,770 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-12 19:03:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:40,960 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-12 19:03:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:40,960 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-12 19:03:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:40,961 INFO L225 Difference]: With dead ends: 88 [2022-07-12 19:03:40,962 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 19:03:40,962 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-12 19:03:40,963 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:40,963 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.2s Time] [2022-07-12 19:03:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 19:03:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-07-12 19:03:40,967 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-12 19:03:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-07-12 19:03:40,968 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 7 [2022-07-12 19:03:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:40,968 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-07-12 19:03:40,969 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-12 19:03:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-07-12 19:03:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 19:03:40,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:40,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:40,979 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-12 19:03:41,169 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-12 19:03:41,170 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-12 19:03:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027164, now seen corresponding path program 1 times [2022-07-12 19:03:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:41,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352963236] [2022-07-12 19:03:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:41,173 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-12 19:03:41,175 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-12 19:03:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:41,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:03:41,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:41,231 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-12 19:03:41,265 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-12 19:03:41,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:41,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:41,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352963236] [2022-07-12 19:03:41,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352963236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:41,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:41,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:41,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485991905] [2022-07-12 19:03:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:41,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:41,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:41,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:41,268 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-12 19:03:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:41,492 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-07-12 19:03:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:03:41,493 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-12 19:03:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:41,494 INFO L225 Difference]: With dead ends: 98 [2022-07-12 19:03:41,494 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 19:03:41,495 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-12 19:03:41,496 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 19:03:41,496 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-12 19:03:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 19:03:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2022-07-12 19:03:41,501 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-12 19:03:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-12 19:03:41,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 7 [2022-07-12 19:03:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:41,503 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-12 19:03:41,503 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-12 19:03:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-12 19:03:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:41,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:41,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:41,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:41,712 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-12 19:03:41,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-12 19:03:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 399103166, now seen corresponding path program 1 times [2022-07-12 19:03:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:41,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728208166] [2022-07-12 19:03:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:41,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:41,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-12 19:03:41,718 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-12 19:03:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:41,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:03:41,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:41,809 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-12 19:03:41,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:41,836 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-12 19:03:41,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:41,896 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-12 19:03:41,909 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-12 19:03:41,924 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-12 19:03:41,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:41,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:41,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728208166] [2022-07-12 19:03:41,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728208166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:41,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:41,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226354916] [2022-07-12 19:03:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:41,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:41,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:41,927 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-12 19:03:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:42,271 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-07-12 19:03:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:42,272 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-12 19:03:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:42,273 INFO L225 Difference]: With dead ends: 167 [2022-07-12 19:03:42,273 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 19:03:42,273 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-12 19:03:42,274 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:42,274 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.3s Time] [2022-07-12 19:03:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 19:03:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 87. [2022-07-12 19:03:42,280 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-12 19:03:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-12 19:03:42,281 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 11 [2022-07-12 19:03:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:42,281 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-12 19:03:42,281 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-12 19:03:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-12 19:03:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:42,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:42,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:42,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 19:03:42,491 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-12 19:03:42,492 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-12 19:03:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-12 19:03:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493348280] [2022-07-12 19:03:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:42,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:42,494 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-12 19:03:42,495 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-12 19:03:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:42,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:03:42,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:42,561 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-12 19:03:42,570 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-12 19:03:42,583 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-12 19:03:42,596 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-12 19:03:42,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:42,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:42,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493348280] [2022-07-12 19:03:42,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493348280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:42,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:42,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061136071] [2022-07-12 19:03:42,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:42,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:42,598 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-12 19:03:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:42,864 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-07-12 19:03:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:42,864 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-12 19:03:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:42,865 INFO L225 Difference]: With dead ends: 86 [2022-07-12 19:03:42,865 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 19:03:42,865 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-12 19:03:42,866 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-12 19:03:42,866 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-12 19:03:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 19:03:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-12 19:03:42,870 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-12 19:03:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-07-12 19:03:42,871 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 11 [2022-07-12 19:03:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:42,871 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-07-12 19:03:42,871 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-12 19:03:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-07-12 19:03:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:42,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:42,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:42,883 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-12 19:03:43,080 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-12 19:03:43,080 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-12 19:03:43,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-12 19:03:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:43,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987229570] [2022-07-12 19:03:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:43,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:43,082 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-12 19:03:43,083 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-12 19:03:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:03:43,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:43,151 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-12 19:03:43,168 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-12 19:03:43,188 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-12 19:03:43,214 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-12 19:03:43,218 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-12 19:03:43,243 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-12 19:03:43,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:43,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:43,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987229570] [2022-07-12 19:03:43,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987229570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:43,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:43,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159770429] [2022-07-12 19:03:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:43,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:43,246 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-12 19:03:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:43,601 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-07-12 19:03:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:43,601 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-12 19:03:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:43,602 INFO L225 Difference]: With dead ends: 82 [2022-07-12 19:03:43,602 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 19:03:43,602 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-12 19:03:43,603 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:43,603 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.3s Time] [2022-07-12 19:03:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 19:03:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-07-12 19:03:43,607 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-12 19:03:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-12 19:03:43,607 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2022-07-12 19:03:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:43,607 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-12 19:03:43,608 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-12 19:03:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-12 19:03:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:43,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:43,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:43,617 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-12 19:03:43,816 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-12 19:03:43,817 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-12 19:03:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash -512699581, now seen corresponding path program 1 times [2022-07-12 19:03:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:43,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312795976] [2022-07-12 19:03:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:43,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:43,819 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-12 19:03:43,820 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-12 19:03:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:03:43,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:43,902 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-12 19:03:43,923 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-12 19:03:43,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:43,961 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-12 19:03:44,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:44,025 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-12 19:03:44,037 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-12 19:03:44,054 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-12 19:03:44,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:44,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312795976] [2022-07-12 19:03:44,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312795976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:44,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:44,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:44,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879707090] [2022-07-12 19:03:44,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:44,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:44,056 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-12 19:03:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:44,365 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-07-12 19:03:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:44,365 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-12 19:03:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:44,366 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:03:44,366 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:03:44,366 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-12 19:03:44,367 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:44,367 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.3s Time] [2022-07-12 19:03:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:03:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2022-07-12 19:03:44,370 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-12 19:03:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-07-12 19:03:44,371 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 12 [2022-07-12 19:03:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:44,371 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-07-12 19:03:44,371 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-12 19:03:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-07-12 19:03:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:44,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:44,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:44,383 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-12 19:03:44,580 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-12 19:03:44,580 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-12 19:03:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -512699580, now seen corresponding path program 1 times [2022-07-12 19:03:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359980194] [2022-07-12 19:03:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:44,584 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-12 19:03:44,586 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-12 19:03:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:44,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:03:44,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:44,659 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-12 19:03:44,674 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-12 19:03:44,680 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-12 19:03:44,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:44,709 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-12 19:03:44,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:44,717 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-12 19:03:44,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:44,791 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-12 19:03:44,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:44,798 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-12 19:03:44,809 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-12 19:03:44,812 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-12 19:03:44,845 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-12 19:03:44,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:44,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:44,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359980194] [2022-07-12 19:03:44,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359980194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:44,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:44,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217682049] [2022-07-12 19:03:44,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:44,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:44,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:44,847 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-12 19:03:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:45,281 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-07-12 19:03:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:45,282 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-12 19:03:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:45,282 INFO L225 Difference]: With dead ends: 155 [2022-07-12 19:03:45,282 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 19:03:45,283 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-12 19:03:45,283 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 162 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:45,283 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.4s Time] [2022-07-12 19:03:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 19:03:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 92. [2022-07-12 19:03:45,287 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-12 19:03:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-07-12 19:03:45,287 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 12 [2022-07-12 19:03:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:45,288 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-07-12 19:03:45,288 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-12 19:03:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-07-12 19:03:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:03:45,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:45,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:45,302 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-12 19:03:45,497 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-12 19:03:45,497 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-12 19:03:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -929437396, now seen corresponding path program 1 times [2022-07-12 19:03:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:45,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756766181] [2022-07-12 19:03:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:45,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:45,499 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-12 19:03:45,500 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-12 19:03:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:45,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:03:45,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:45,630 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:03:45,630 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-12 19:03:45,639 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-12 19:03:45,664 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-12 19:03:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:45,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-12 19:03:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:45,819 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-12 19:03:46,067 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-12 19:03:46,068 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 64 treesize of output 74 [2022-07-12 19:03:46,343 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-12 19:03:46,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 66 [2022-07-12 19:03:46,448 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-12 19:03:46,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:46,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756766181] [2022-07-12 19:03:46,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756766181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:46,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:46,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095905894] [2022-07-12 19:03:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:46,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:03:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:03:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:46,450 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-12 19:03:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:46,834 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-12 19:03:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:46,835 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-12 19:03:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:46,835 INFO L225 Difference]: With dead ends: 97 [2022-07-12 19:03:46,835 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 19:03:46,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:46,836 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-12 19:03:46,836 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-12 19:03:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 19:03:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-07-12 19:03:46,839 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-12 19:03:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-12 19:03:46,840 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 15 [2022-07-12 19:03:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:46,840 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-12 19:03:46,840 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-12 19:03:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-12 19:03:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:03:46,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:46,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:46,853 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-12 19:03:47,050 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-12 19:03:47,051 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-12 19:03:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash -929437395, now seen corresponding path program 1 times [2022-07-12 19:03:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:47,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793747870] [2022-07-12 19:03:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:47,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:47,053 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-12 19:03:47,055 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-12 19:03:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:03:47,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:47,160 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-12 19:03:47,172 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-12 19:03:47,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:47,193 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-12 19:03:47,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:47,241 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-12 19:03:47,425 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-12 19:03:47,425 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-12 19:03:47,434 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:03:47,435 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-12 19:03:47,481 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-12 19:03:47,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:47,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793747870] [2022-07-12 19:03:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793747870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835110871] [2022-07-12 19:03:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:47,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:47,483 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-12 19:03:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:47,807 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-12 19:03:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:47,808 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-12 19:03:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:47,808 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:03:47,808 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:03:47,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:47,809 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-12 19:03:47,810 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-12 19:03:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:03:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-07-12 19:03:47,812 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-12 19:03:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-07-12 19:03:47,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 15 [2022-07-12 19:03:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:47,819 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-07-12 19:03:47,819 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-12 19:03:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-07-12 19:03:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:03:47,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:47,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:47,829 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-12 19:03:48,020 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-12 19:03:48,020 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-12 19:03:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash -448678999, now seen corresponding path program 1 times [2022-07-12 19:03:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:48,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422732773] [2022-07-12 19:03:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:48,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:48,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:48,023 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-12 19:03:48,025 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-12 19:03:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:48,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:03:48,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:48,114 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-12 19:03:48,124 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-12 19:03:48,141 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-12 19:03:48,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:48,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:48,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422732773] [2022-07-12 19:03:48,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422732773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:48,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:48,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987677324] [2022-07-12 19:03:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:48,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:48,144 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-12 19:03:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:48,362 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-07-12 19:03:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:48,363 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-12 19:03:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:48,364 INFO L225 Difference]: With dead ends: 94 [2022-07-12 19:03:48,364 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 19:03:48,364 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-12 19:03:48,364 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:48,365 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.2s Time] [2022-07-12 19:03:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 19:03:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-07-12 19:03:48,367 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-12 19:03:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-12 19:03:48,367 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 15 [2022-07-12 19:03:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:48,367 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-12 19:03:48,367 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-12 19:03:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-12 19:03:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:48,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:48,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:48,380 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-12 19:03:48,568 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-12 19:03:48,569 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-12 19:03:48,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196987, now seen corresponding path program 1 times [2022-07-12 19:03:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:48,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876421296] [2022-07-12 19:03:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:48,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:48,571 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-12 19:03:48,572 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-12 19:03:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:48,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:03:48,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:48,666 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-12 19:03:48,689 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-12 19:03:48,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:48,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:48,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876421296] [2022-07-12 19:03:48,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876421296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:48,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:48,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017958890] [2022-07-12 19:03:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:48,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:48,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:48,691 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-12 19:03:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:49,140 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2022-07-12 19:03:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:49,141 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-12 19:03:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:49,141 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:03:49,141 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:03:49,142 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-12 19:03:49,142 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:49,142 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.4s Time] [2022-07-12 19:03:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:03:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2022-07-12 19:03:49,144 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-12 19:03:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-07-12 19:03:49,145 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 16 [2022-07-12 19:03:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:49,145 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-07-12 19:03:49,145 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-12 19:03:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-07-12 19:03:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:49,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:49,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:49,155 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-12 19:03:49,346 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-12 19:03:49,347 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-12 19:03:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196988, now seen corresponding path program 1 times [2022-07-12 19:03:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:49,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114404712] [2022-07-12 19:03:49,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:49,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:49,349 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-12 19:03:49,351 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-12 19:03:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:49,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:03:49,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:49,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 23 treesize of output 15 [2022-07-12 19:03:49,502 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-12 19:03:49,571 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-12 19:03:49,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:49,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:49,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114404712] [2022-07-12 19:03:49,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114404712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:49,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:49,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:03:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322160413] [2022-07-12 19:03:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:49,572 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-12 19:03:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:50,492 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-07-12 19:03:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:50,493 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-12 19:03:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:50,494 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:03:50,494 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:03:50,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:50,495 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:50,495 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.6s Time] [2022-07-12 19:03:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:03:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2022-07-12 19:03:50,497 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-12 19:03:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-12 19:03:50,498 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 16 [2022-07-12 19:03:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:50,498 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-12 19:03:50,498 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-12 19:03:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-12 19:03:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:03:50,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:50,499 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-12 19:03:50,512 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-12 19:03:50,699 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-12 19:03:50,699 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-12 19:03:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 770466058, now seen corresponding path program 1 times [2022-07-12 19:03:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:50,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617690194] [2022-07-12 19:03:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:50,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:50,701 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-12 19:03:50,703 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-12 19:03:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:50,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:03:50,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:50,809 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-12 19:03:50,813 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-12 19:03:50,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:50,832 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-12 19:03:50,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:50,839 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-12 19:03:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:50,895 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-12 19:03:50,899 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-12 19:03:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:50,905 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-12 19:03:50,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 15 treesize of output 7 [2022-07-12 19:03:50,931 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-12 19:03:50,967 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-12 19:03:50,978 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-12 19:03:50,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:50,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:50,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617690194] [2022-07-12 19:03:50,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617690194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:50,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:50,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:03:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297515163] [2022-07-12 19:03:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:50,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:50,980 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-12 19:03:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:51,404 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-12 19:03:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:51,404 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-12 19:03:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:51,405 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:03:51,405 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:03:51,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:03:51,406 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 205 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 19:03:51,406 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-12 19:03:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:03:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2022-07-12 19:03:51,408 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-12 19:03:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-07-12 19:03:51,409 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2022-07-12 19:03:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:51,409 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-07-12 19:03:51,409 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-12 19:03:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-07-12 19:03:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:03:51,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:51,410 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-12 19:03:51,417 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-12 19:03:51,611 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-12 19:03:51,611 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-12 19:03:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1441667505, now seen corresponding path program 1 times [2022-07-12 19:03:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:51,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692058670] [2022-07-12 19:03:51,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:51,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:51,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:51,613 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-12 19:03:51,614 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-12 19:03:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:51,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:03:51,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:51,681 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-12 19:03:51,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:51,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:51,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692058670] [2022-07-12 19:03:51,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692058670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:51,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:51,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:51,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544303053] [2022-07-12 19:03:51,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:51,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:51,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:51,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:51,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:51,684 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-12 19:03:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:51,690 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-07-12 19:03:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:51,691 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-12 19:03:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:51,691 INFO L225 Difference]: With dead ends: 92 [2022-07-12 19:03:51,691 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 19:03:51,692 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-12 19:03:51,692 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-12 19:03:51,693 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-12 19:03:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 19:03:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-12 19:03:51,695 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-12 19:03:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-07-12 19:03:51,696 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 19 [2022-07-12 19:03:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:51,696 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-07-12 19:03:51,697 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-12 19:03:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-07-12 19:03:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:03:51,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:51,699 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-12 19:03:51,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-12 19:03:51,906 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-12 19:03:51,906 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-12 19:03:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -740864340, now seen corresponding path program 1 times [2022-07-12 19:03:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912828192] [2022-07-12 19:03:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:51,909 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-12 19:03:51,910 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-12 19:03:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:51,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:03:51,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:52,004 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-12 19:03:52,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:52,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:52,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912828192] [2022-07-12 19:03:52,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912828192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:52,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:52,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352702043] [2022-07-12 19:03:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:52,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:52,006 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-12 19:03:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:52,035 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-07-12 19:03:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:52,036 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-12 19:03:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:52,037 INFO L225 Difference]: With dead ends: 158 [2022-07-12 19:03:52,038 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 19:03:52,038 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-12 19:03:52,038 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-12 19:03:52,039 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-12 19:03:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 19:03:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-07-12 19:03:52,042 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-12 19:03:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-12 19:03:52,042 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 19 [2022-07-12 19:03:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:52,043 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-12 19:03:52,043 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-12 19:03:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-07-12 19:03:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:52,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:52,048 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-12 19:03:52,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:52,257 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-12 19:03:52,258 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-12 19:03:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972818, now seen corresponding path program 1 times [2022-07-12 19:03:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:52,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337556552] [2022-07-12 19:03:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:52,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:52,260 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-12 19:03:52,261 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-12 19:03:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:52,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:03:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:52,344 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-12 19:03:52,350 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-12 19:03:52,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:52,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:52,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337556552] [2022-07-12 19:03:52,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337556552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:52,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:52,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730445798] [2022-07-12 19:03:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:52,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:52,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:52,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:52,352 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-12 19:03:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:52,534 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-07-12 19:03:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:52,535 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-12 19:03:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:52,535 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:03:52,535 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:03:52,535 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-12 19:03:52,536 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:52,536 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.2s Time] [2022-07-12 19:03:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:03:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 19:03:52,538 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-12 19:03:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-07-12 19:03:52,538 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2022-07-12 19:03:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:52,539 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-07-12 19:03:52,539 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-12 19:03:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-07-12 19:03:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:52,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:52,540 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-12 19:03:52,546 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-12 19:03:52,743 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-12 19:03:52,744 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-12 19:03:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972817, now seen corresponding path program 1 times [2022-07-12 19:03:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:52,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431190656] [2022-07-12 19:03:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:52,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:52,746 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-12 19:03:52,748 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-12 19:03:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:52,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:03:52,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:52,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, 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-12 19:03:52,905 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-12 19:03:52,933 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-12 19:03:52,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:52,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:52,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431190656] [2022-07-12 19:03:52,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431190656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:52,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:52,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411870693] [2022-07-12 19:03:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:52,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:52,935 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-12 19:03:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:53,258 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-12 19:03:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:53,259 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-12 19:03:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:53,259 INFO L225 Difference]: With dead ends: 101 [2022-07-12 19:03:53,259 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 19:03:53,259 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-12 19:03:53,260 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-12 19:03:53,260 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-12 19:03:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 19:03:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-12 19:03:53,262 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-12 19:03:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2022-07-12 19:03:53,263 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 20 [2022-07-12 19:03:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:53,263 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2022-07-12 19:03:53,263 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-12 19:03:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-07-12 19:03:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:03:53,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:53,264 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-12 19:03:53,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:53,473 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-12 19:03:53,473 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-12 19:03:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1226162375, now seen corresponding path program 1 times [2022-07-12 19:03:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:53,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141561941] [2022-07-12 19:03:53,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:53,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:53,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:53,475 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-12 19:03:53,476 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-12 19:03:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:53,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 19:03:53,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:53,587 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-12 19:03:53,614 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:53,615 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-12 19:03:53,637 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-12 19:03:53,713 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:53,714 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-12 19:03:53,737 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:53,737 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-12 19:03:53,773 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:53,773 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-12 19:03:53,792 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-12 19:03:53,820 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-12 19:03:53,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:53,841 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-12 19:03:53,887 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-12 19:03:53,894 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-12 19:03:53,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:53,907 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-12 19:03:53,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:53,918 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-12 19:03:53,939 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-12 19:03:54,063 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-12 19:03:54,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:54,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141561941] [2022-07-12 19:03:54,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141561941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:54,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:03:54,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-12 19:03:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625805789] [2022-07-12 19:03:54,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:54,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:03:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:54,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:03:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-07-12 19:03:54,065 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-12 19:03:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:54,881 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-07-12 19:03:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:03:54,883 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-12 19:03:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:54,884 INFO L225 Difference]: With dead ends: 198 [2022-07-12 19:03:54,884 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 19:03:54,884 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-12 19:03:54,884 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 209 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:54,885 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.6s Time] [2022-07-12 19:03:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 19:03:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 120. [2022-07-12 19:03:54,888 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-12 19:03:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2022-07-12 19:03:54,888 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 21 [2022-07-12 19:03:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:54,889 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2022-07-12 19:03:54,889 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-12 19:03:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-07-12 19:03:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:54,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:54,894 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-12 19:03:54,907 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-12 19:03:55,104 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-12 19:03:55,104 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-12 19:03:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 960368175, now seen corresponding path program 1 times [2022-07-12 19:03:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:55,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811175403] [2022-07-12 19:03:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:55,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:55,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:55,106 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-12 19:03:55,108 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-12 19:03:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:55,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:03:55,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:55,208 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-12 19:03:55,220 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-12 19:03:55,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:55,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811175403] [2022-07-12 19:03:55,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811175403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:55,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:55,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738307749] [2022-07-12 19:03:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:55,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:55,222 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-12 19:03:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:55,453 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-12 19:03:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:55,453 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-12 19:03:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:55,454 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:03:55,454 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:03:55,454 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-12 19:03:55,454 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-12 19:03:55,455 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-12 19:03:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:03:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-12 19:03:55,457 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-12 19:03:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-07-12 19:03:55,457 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 22 [2022-07-12 19:03:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:55,458 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-07-12 19:03:55,458 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-12 19:03:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-07-12 19:03:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:55,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:55,458 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-12 19:03:55,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-12 19:03:55,658 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-12 19:03:55,659 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-12 19:03:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 960368176, now seen corresponding path program 1 times [2022-07-12 19:03:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639700327] [2022-07-12 19:03:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:55,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:55,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:55,661 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-12 19:03:55,661 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-12 19:03:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:03:55,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:55,819 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-12 19:03:55,822 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-12 19:03:55,890 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-12 19:03:55,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:03:55,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:03:55,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639700327] [2022-07-12 19:03:55,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639700327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:55,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:55,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925270279] [2022-07-12 19:03:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:55,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:03:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:55,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:55,892 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-12 19:03:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:56,481 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-12 19:03:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:56,485 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-12 19:03:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:56,486 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:03:56,486 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:03:56,486 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-12 19:03:56,486 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-12 19:03:56,487 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-12 19:03:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:03:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-12 19:03:56,489 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-12 19:03:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2022-07-12 19:03:56,490 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 22 [2022-07-12 19:03:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:56,490 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2022-07-12 19:03:56,490 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-12 19:03:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2022-07-12 19:03:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:56,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:56,491 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-12 19:03:56,500 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-12 19:03:56,699 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-12 19:03:56,700 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-12 19:03:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -643667878, now seen corresponding path program 1 times [2022-07-12 19:03:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:03:56,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095743406] [2022-07-12 19:03:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:03:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:03:56,702 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-12 19:03:56,703 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-12 19:03:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:56,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:03:56,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:56,797 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-12 19:03:56,831 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:03:56,832 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-12 19:03:56,866 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-12 19:03:56,952 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:56,952 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-12 19:03:56,979 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:56,979 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-12 19:03:57,019 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:57,019 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-12 19:03:57,038 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-12 19:03:57,094 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-12 19:03:57,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:57,148 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_~x~0#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-12 19:03:57,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:57,246 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-12 19:03:57,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:57,256 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-12 19:03:57,261 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-12 19:04:14,334 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-12 19:04:14,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095743406] [2022-07-12 19:04:14,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095743406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:14,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:14,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-12 19:04:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256171973] [2022-07-12 19:04:14,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:14,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:04:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:04:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=265, Unknown=6, NotChecked=34, Total=380 [2022-07-12 19:04:14,337 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-12 19:04:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:14,695 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-07-12 19:04:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:04:14,696 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-12 19:04:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:14,697 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:04:14,697 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:04:14,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=126, Invalid=378, Unknown=6, NotChecked=42, Total=552 [2022-07-12 19:04:14,698 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:14,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 421 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 260 Unchecked, 0.2s Time] [2022-07-12 19:04:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:04:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-12 19:04:14,700 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-12 19:04:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2022-07-12 19:04:14,701 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 22 [2022-07-12 19:04:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:14,701 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2022-07-12 19:04:14,701 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-12 19:04:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2022-07-12 19:04:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:04:14,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:14,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, 1, 1] [2022-07-12 19:04:14,717 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-12 19:04:14,903 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-12 19:04:14,903 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-12 19:04:14,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash -643667877, now seen corresponding path program 1 times [2022-07-12 19:04:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:14,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233308194] [2022-07-12 19:04:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:14,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:14,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:14,905 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-12 19:04:14,906 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-12 19:04:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:15,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:04:15,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:15,012 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-12 19:04:15,049 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-12 19:04:15,066 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:15,066 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-12 19:04:15,091 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-12 19:04:15,100 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-12 19:04:15,205 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:15,205 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-12 19:04:15,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:15,215 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-12 19:04:15,241 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:04:15,242 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-12 19:04:15,246 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-12 19:04:15,259 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:15,259 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-12 19:04:15,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:15,347 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-12 19:04:15,351 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-12 19:04:15,375 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-12 19:04:15,378 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-12 19:04:15,418 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-12 19:04:15,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:15,585 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-12 19:04:15,668 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-12 19:04:15,693 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-12 19:04:15,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:15,714 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-12 19:04:15,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:15,730 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-12 19:04:15,734 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-12 19:04:15,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:15,765 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-12 19:04:15,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:15,775 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-12 19:04:15,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:15,781 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-12 19:04:15,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:15,788 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-12 19:04:15,897 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-12 19:04:15,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233308194] [2022-07-12 19:04:15,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233308194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:15,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:04:15,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 19:04:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190614082] [2022-07-12 19:04:15,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:04:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:04:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-12 19:04:15,899 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-12 19:04:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:18,367 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2022-07-12 19:04:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:04:18,368 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-12 19:04:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:18,369 INFO L225 Difference]: With dead ends: 192 [2022-07-12 19:04:18,369 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 19:04:18,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=616, Unknown=3, NotChecked=162, Total=930 [2022-07-12 19:04:18,370 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 248 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:18,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 454 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 623 Invalid, 0 Unknown, 306 Unchecked, 1.2s Time] [2022-07-12 19:04:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 19:04:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2022-07-12 19:04:18,373 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-12 19:04:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2022-07-12 19:04:18,374 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 22 [2022-07-12 19:04:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:18,374 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2022-07-12 19:04:18,374 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-12 19:04:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2022-07-12 19:04:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:04:18,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:18,375 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-12 19:04:18,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:18,585 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-12 19:04:18,585 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-12 19:04:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 977716951, now seen corresponding path program 1 times [2022-07-12 19:04:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:18,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68936917] [2022-07-12 19:04:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:18,587 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-12 19:04:18,591 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-12 19:04:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:18,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 19:04:18,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:18,733 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-12 19:04:18,745 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-12 19:04:18,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:18,766 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-12 19:04:18,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:18,828 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-12 19:04:18,835 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-12 19:04:21,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:21,032 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-12 19:04:29,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:29,695 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:04:29,696 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-12 19:04:29,705 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:04:29,705 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-12 19:04:29,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:29,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:29,854 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-12 19:04:29,914 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-12 19:04:29,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:29,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:29,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68936917] [2022-07-12 19:04:29,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68936917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:29,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:29,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:04:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146431615] [2022-07-12 19:04:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:29,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:04:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:04:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=144, Unknown=5, NotChecked=0, Total=182 [2022-07-12 19:04:29,916 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-12 19:04:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:34,547 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2022-07-12 19:04:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:04:34,548 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-12 19:04:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:34,549 INFO L225 Difference]: With dead ends: 136 [2022-07-12 19:04:34,549 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:04:34,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=57, Invalid=242, Unknown=7, NotChecked=0, Total=306 [2022-07-12 19:04:34,550 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:34,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 429 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 189 Unchecked, 0.3s Time] [2022-07-12 19:04:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:04:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2022-07-12 19:04:34,553 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-12 19:04:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2022-07-12 19:04:34,553 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 23 [2022-07-12 19:04:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:34,554 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2022-07-12 19:04:34,554 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-12 19:04:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2022-07-12 19:04:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:04:34,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:34,555 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-12 19:04:34,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 19:04:34,763 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-12 19:04:34,764 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-12 19:04:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash -504150028, now seen corresponding path program 1 times [2022-07-12 19:04:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:34,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373178096] [2022-07-12 19:04:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:34,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:34,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:34,766 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-12 19:04:34,768 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-12 19:04:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:34,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:04:34,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:34,943 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-12 19:04:34,947 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-12 19:04:34,988 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-12 19:04:35,005 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-12 19:04:35,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:35,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373178096] [2022-07-12 19:04:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373178096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:35,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:35,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:04:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577217264] [2022-07-12 19:04:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:35,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:04:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:04:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:04:35,007 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-12 19:04:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:35,619 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2022-07-12 19:04:35,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:04:35,620 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-12 19:04:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:35,621 INFO L225 Difference]: With dead ends: 143 [2022-07-12 19:04:35,621 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 19:04:35,621 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-12 19:04:35,621 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:35,622 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.5s Time] [2022-07-12 19:04:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 19:04:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2022-07-12 19:04:35,624 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-12 19:04:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2022-07-12 19:04:35,626 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 24 [2022-07-12 19:04:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:35,627 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2022-07-12 19:04:35,627 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-12 19:04:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2022-07-12 19:04:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:04:35,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:35,628 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-12 19:04:35,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:35,828 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-12 19:04:35,829 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-12 19:04:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1519298741, now seen corresponding path program 1 times [2022-07-12 19:04:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:35,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231487097] [2022-07-12 19:04:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:35,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:35,832 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-12 19:04:35,835 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-12 19:04:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:35,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:04:35,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:36,006 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:04:36,007 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-12 19:04:36,074 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-12 19:04:36,074 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-12 19:04:36,098 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-12 19:04:36,104 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-12 19:04:36,211 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:04:36,211 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-12 19:04:36,221 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-12 19:04:36,276 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 19:04:36,277 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-12 19:04:36,285 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-12 19:04:36,365 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-12 19:04:36,365 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-12 19:04:36,371 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-12 19:04:36,409 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-12 19:04:36,537 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:04:36,537 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-12 19:04:36,558 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-12 19:04:36,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:36,840 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-12 19:04:36,862 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-12 19:04:36,892 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-12 19:04:37,117 INFO L356 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2022-07-12 19:04:37,118 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-12 19:04:39,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:39,696 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 51542 treesize of output 51396 [2022-07-12 19:04:39,958 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 56961 treesize of output 56453 [2022-07-12 19:04:40,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:40,378 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 56453 treesize of output 49045 [2022-07-12 19:04:40,663 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 49037 treesize of output 48529