./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-token-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/dll-token-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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:02:58,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:02:58,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:02:58,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:02:58,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:02:58,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:02:58,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:02:58,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:02:58,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:02:58,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:02:58,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:02:58,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:02:58,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:02:58,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:02:58,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:02:58,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:02:58,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:02:58,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:02:58,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:02:58,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:02:58,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:02:58,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:02:58,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:02:58,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:02:58,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:02:58,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:02:58,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:02:58,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:02:58,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:02:58,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:02:58,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:02:58,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:02:58,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:02:58,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:02:58,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:02:58,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:02:58,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:02:58,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:02:58,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:02:58,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:02:58,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:02:58,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:02:58,544 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:02:58,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:02:58,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:02:58,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:02:58,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:02:58,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:02:58,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:02:58,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:02:58,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:02:58,590 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:02:58,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:02:58,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:02:58,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:02:58,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:02:58,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:02:58,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:02:58,592 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:02:58,592 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:02:58,592 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:02:58,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:02:58,593 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:02:58,593 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:02:58,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:02:58,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:02:58,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:02:58,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:02:58,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:02:58,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:02:58,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:02:58,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:02:58,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:02:58,595 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2022-07-12 19:02:58,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:02:58,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:02:58,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:02:58,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:02:58,862 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:02:58,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2022-07-12 19:02:58,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9e95b2e/27df8231004c481297eb68fb7fa4868e/FLAG7ab58a5e3 [2022-07-12 19:02:59,384 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:02:59,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2022-07-12 19:02:59,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9e95b2e/27df8231004c481297eb68fb7fa4868e/FLAG7ab58a5e3 [2022-07-12 19:02:59,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9e95b2e/27df8231004c481297eb68fb7fa4868e [2022-07-12 19:02:59,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:02:59,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:02:59,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:02:59,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:02:59,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:02:59,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40675af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59, skipping insertion in model container [2022-07-12 19:02:59,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:02:59,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:02:59,727 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/dll-token-1.i[22229,22242] [2022-07-12 19:02:59,743 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/dll-token-1.i[22398,22411] [2022-07-12 19:02:59,745 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/dll-token-1.i[22489,22502] [2022-07-12 19:02:59,748 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/dll-token-1.i[22571,22584] [2022-07-12 19:02:59,750 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/dll-token-1.i[22649,22662] [2022-07-12 19:02:59,755 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/dll-token-1.i[22795,22808] [2022-07-12 19:02:59,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:02:59,771 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:02:59,813 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/dll-token-1.i[22229,22242] [2022-07-12 19:02:59,815 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/dll-token-1.i[22398,22411] [2022-07-12 19:02:59,816 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/dll-token-1.i[22489,22502] [2022-07-12 19:02:59,817 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/dll-token-1.i[22571,22584] [2022-07-12 19:02:59,825 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/dll-token-1.i[22649,22662] [2022-07-12 19:02:59,829 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/dll-token-1.i[22795,22808] [2022-07-12 19:02:59,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:02:59,858 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:02:59,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59 WrapperNode [2022-07-12 19:02:59,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:02:59,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:02:59,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:02:59,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:02:59,868 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:02:59" (1/1) ... [2022-07-12 19:02:59,889 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:02:59" (1/1) ... [2022-07-12 19:02:59,910 INFO L137 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2022-07-12 19:02:59,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:02:59,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:02:59,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:02:59,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:02:59,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:02:59,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:02:59,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:02:59,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:02:59,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (1/1) ... [2022-07-12 19:02:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:02:59,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:00,001 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:00,019 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:00,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:03:00,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:03:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:03:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:03:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:03:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:03:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:03:00,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:03:00,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:03:00,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:03:00,148 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:03:00,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:03:00,464 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:03:00,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:03:00,471 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-12 19:03:00,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:00 BoogieIcfgContainer [2022-07-12 19:03:00,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:03:00,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:03:00,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:03:00,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:03:00,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:02:59" (1/3) ... [2022-07-12 19:03:00,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea5631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:00, skipping insertion in model container [2022-07-12 19:03:00,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:02:59" (2/3) ... [2022-07-12 19:03:00,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea5631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:00, skipping insertion in model container [2022-07-12 19:03:00,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:00" (3/3) ... [2022-07-12 19:03:00,481 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2022-07-12 19:03:00,494 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:03:00,495 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-12 19:03:00,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:03:00,559 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@3d471985, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62951a8a [2022-07-12 19:03:00,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-12 19:03:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 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:03:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:00,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:00,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:00,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:03:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204876591] [2022-07-12 19:03:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:00,798 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:00,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204876591] [2022-07-12 19:03:00,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204876591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:00,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228570160] [2022-07-12 19:03:00,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:00,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:00,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:00,842 INFO L87 Difference]: Start difference. First operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 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) 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:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:01,024 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-07-12 19:03:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:01,036 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:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:01,043 INFO L225 Difference]: With dead ends: 153 [2022-07-12 19:03:01,044 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 19:03:01,046 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:01,050 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:01,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 19:03:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-07-12 19:03:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2022-07-12 19:03:01,103 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2022-07-12 19:03:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:01,104 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2022-07-12 19:03:01,104 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:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2022-07-12 19:03:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:01,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:01,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:01,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:03:01,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:03:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:01,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829547098] [2022-07-12 19:03:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:01,189 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:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829547098] [2022-07-12 19:03:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829547098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:01,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:01,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261975404] [2022-07-12 19:03:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:01,193 INFO L87 Difference]: Start difference. First operand 131 states and 133 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:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:01,273 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-07-12 19:03:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:01,274 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:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:01,275 INFO L225 Difference]: With dead ends: 156 [2022-07-12 19:03:01,275 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 19:03:01,275 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:01,277 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:01,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 19:03:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2022-07-12 19:03:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2022-07-12 19:03:01,284 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2022-07-12 19:03:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:01,284 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2022-07-12 19:03:01,285 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:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2022-07-12 19:03:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:03:01,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:01,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:03:01,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2022-07-12 19:03:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:01,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777833381] [2022-07-12 19:03:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:01,389 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:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777833381] [2022-07-12 19:03:01,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777833381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:01,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:01,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876497662] [2022-07-12 19:03:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:01,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:01,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:01,393 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:01,679 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-07-12 19:03:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:03:01,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:03:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:01,681 INFO L225 Difference]: With dead ends: 241 [2022-07-12 19:03:01,681 INFO L226 Difference]: Without dead ends: 241 [2022-07-12 19:03:01,681 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:01,682 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 271 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:01,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 113 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-12 19:03:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2022-07-12 19:03:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2022-07-12 19:03:01,691 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2022-07-12 19:03:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:01,691 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2022-07-12 19:03:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2022-07-12 19:03:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:03:01,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:01,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:01,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:03:01,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:01,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2022-07-12 19:03:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:01,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838136951] [2022-07-12 19:03:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:01,732 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:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:01,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838136951] [2022-07-12 19:03:01,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838136951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:01,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:01,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222804583] [2022-07-12 19:03:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:01,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:01,735 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:01,883 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-07-12 19:03:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:03:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:01,884 INFO L225 Difference]: With dead ends: 157 [2022-07-12 19:03:01,884 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 19:03:01,885 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:01,886 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 181 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:01,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 74 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 19:03:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-07-12 19:03:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-07-12 19:03:01,904 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2022-07-12 19:03:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:01,905 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-07-12 19:03:01,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-07-12 19:03:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:01,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:01,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:01,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:03:01,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:01,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-12 19:03:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:01,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466978452] [2022-07-12 19:03:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:01,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:02,021 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:02,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466978452] [2022-07-12 19:03:02,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466978452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:02,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:02,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275737274] [2022-07-12 19:03:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:02,030 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:02,171 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-07-12 19:03:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:02,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 19:03:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:02,173 INFO L225 Difference]: With dead ends: 151 [2022-07-12 19:03:02,173 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 19:03:02,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:02,174 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:02,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 278 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 19:03:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-12 19:03:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-07-12 19:03:02,180 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2022-07-12 19:03:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:02,181 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-07-12 19:03:02,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-07-12 19:03:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:02,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:02,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:02,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:03:02,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-12 19:03:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:02,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127585422] [2022-07-12 19:03:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:02,238 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:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:02,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127585422] [2022-07-12 19:03:02,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127585422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:02,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:02,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295300091] [2022-07-12 19:03:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:02,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:02,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:02,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:02,242 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:02,374 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-07-12 19:03:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 19:03:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:02,376 INFO L225 Difference]: With dead ends: 150 [2022-07-12 19:03:02,376 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 19:03:02,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:02,377 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:02,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 283 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 19:03:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-12 19:03:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2022-07-12 19:03:02,383 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2022-07-12 19:03:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:02,383 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2022-07-12 19:03:02,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-07-12 19:03:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:03:02,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:02,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:02,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:03:02,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2022-07-12 19:03:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:02,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524457451] [2022-07-12 19:03:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:02,462 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:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:02,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524457451] [2022-07-12 19:03:02,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524457451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:02,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:02,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882829844] [2022-07-12 19:03:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:02,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:02,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:02,465 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:02,592 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-07-12 19:03:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:03:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:02,594 INFO L225 Difference]: With dead ends: 149 [2022-07-12 19:03:02,594 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 19:03:02,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:02,595 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:02,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 19:03:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-07-12 19:03:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-07-12 19:03:02,600 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2022-07-12 19:03:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:02,600 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-07-12 19:03:02,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-07-12 19:03:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:03:02,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:02,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:02,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:03:02,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2022-07-12 19:03:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:02,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405951563] [2022-07-12 19:03:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:02,658 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:02,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:02,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405951563] [2022-07-12 19:03:02,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405951563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:02,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:02,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503582255] [2022-07-12 19:03:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:02,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:02,661 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:02,780 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-07-12 19:03:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:02,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:03:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:02,782 INFO L225 Difference]: With dead ends: 148 [2022-07-12 19:03:02,782 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 19:03:02,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:02,783 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:02,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 19:03:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-12 19:03:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 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:03:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-07-12 19:03:02,787 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2022-07-12 19:03:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:02,788 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-07-12 19:03:02,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-07-12 19:03:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:02,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:02,789 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:02,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:03:02,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-12 19:03:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:02,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497161641] [2022-07-12 19:03:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:02,876 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:02,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:02,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497161641] [2022-07-12 19:03:02,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497161641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:02,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:02,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455946182] [2022-07-12 19:03:02,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:02,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:02,879 INFO L87 Difference]: Start difference. First operand 148 states and 159 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:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:03,126 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-07-12 19:03:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:03,127 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:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:03,129 INFO L225 Difference]: With dead ends: 152 [2022-07-12 19:03:03,129 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 19:03:03,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:03:03,133 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 184 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:03,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 188 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 19:03:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-07-12 19:03:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2022-07-12 19:03:03,139 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2022-07-12 19:03:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:03,140 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2022-07-12 19:03:03,140 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:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-07-12 19:03:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:03,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:03,141 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:03,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:03:03,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:03,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-12 19:03:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:03,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709721059] [2022-07-12 19:03:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:03,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:03,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:03,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709721059] [2022-07-12 19:03:03,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709721059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:03,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:03,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:03:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299248828] [2022-07-12 19:03:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:03,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:03:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:03:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:03,277 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:03,731 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-07-12 19:03:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:03:03,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:03,732 INFO L225 Difference]: With dead ends: 149 [2022-07-12 19:03:03,732 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 19:03:03,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:03:03,733 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 182 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:03,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 282 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 19:03:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2022-07-12 19:03:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-07-12 19:03:03,736 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2022-07-12 19:03:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:03,736 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-07-12 19:03:03,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-07-12 19:03:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:03,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:03,737 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:03,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:03:03,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2022-07-12 19:03:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:03,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392521542] [2022-07-12 19:03:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:03,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:03,815 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:03,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:03,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392521542] [2022-07-12 19:03:03,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392521542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:03,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:03,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646249681] [2022-07-12 19:03:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:03,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:03,817 INFO L87 Difference]: Start difference. First operand 123 states and 133 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:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:04,036 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-12 19:03:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:04,037 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:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:04,038 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:03:04,038 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:03:04,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:04,039 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 63 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:04,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 253 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:03:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-07-12 19:03:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2022-07-12 19:03:04,042 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2022-07-12 19:03:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:04,042 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2022-07-12 19:03:04,042 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:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2022-07-12 19:03:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:04,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:04,043 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:04,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:03:04,046 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2022-07-12 19:03:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:04,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271882830] [2022-07-12 19:03:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:04,157 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:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:04,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271882830] [2022-07-12 19:03:04,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271882830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:04,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:04,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534420786] [2022-07-12 19:03:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:04,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:04,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:04,160 INFO L87 Difference]: Start difference. First operand 122 states and 132 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:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:04,385 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-07-12 19:03:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:04,386 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:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:04,387 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:03:04,388 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:03:04,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:04,388 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:04,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 263 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:03:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-07-12 19:03:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-07-12 19:03:04,392 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2022-07-12 19:03:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:04,392 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-07-12 19:03:04,393 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:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-07-12 19:03:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:03:04,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:04,393 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:04,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:03:04,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:04,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2022-07-12 19:03:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:04,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284054936] [2022-07-12 19:03:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:04,484 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:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284054936] [2022-07-12 19:03:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284054936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:04,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667413052] [2022-07-12 19:03:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:04,487 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:04,584 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-07-12 19:03:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:03:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:04,586 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:03:04,586 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:03:04,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:04,586 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 153 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:04,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 113 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:03:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-07-12 19:03:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-07-12 19:03:04,589 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2022-07-12 19:03:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:04,589 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-07-12 19:03:04,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-07-12 19:03:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:04,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:04,590 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:04,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:03:04,592 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2022-07-12 19:03:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:04,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272767308] [2022-07-12 19:03:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:04,645 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:04,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:04,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272767308] [2022-07-12 19:03:04,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272767308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:04,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:04,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629316430] [2022-07-12 19:03:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:04,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:04,648 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:04,732 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-07-12 19:03:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:04,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:04,734 INFO L225 Difference]: With dead ends: 181 [2022-07-12 19:03:04,734 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 19:03:04,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:04,735 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:04,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 19:03:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2022-07-12 19:03:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-07-12 19:03:04,739 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2022-07-12 19:03:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:04,739 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-07-12 19:03:04,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-07-12 19:03:04,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:03:04,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:04,740 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:03:04,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:03:04,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2022-07-12 19:03:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:04,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072199698] [2022-07-12 19:03:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:04,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:04,990 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:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:04,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072199698] [2022-07-12 19:03:04,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072199698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:04,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:04,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:03:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376896860] [2022-07-12 19:03:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:04,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:03:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:03:04,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:04,992 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:05,351 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-07-12 19:03:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:03:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:05,352 INFO L225 Difference]: With dead ends: 225 [2022-07-12 19:03:05,353 INFO L226 Difference]: Without dead ends: 225 [2022-07-12 19:03:05,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:03:05,353 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 426 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:05,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 313 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-12 19:03:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2022-07-12 19:03:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-12 19:03:05,357 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2022-07-12 19:03:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:05,357 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-12 19:03:05,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-12 19:03:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:03:05,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:05,359 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:03:05,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:03:05,359 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2022-07-12 19:03:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:05,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628939822] [2022-07-12 19:03:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:05,437 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:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628939822] [2022-07-12 19:03:05,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628939822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:05,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:05,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646575980] [2022-07-12 19:03:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:05,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:05,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:05,440 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:05,512 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-07-12 19:03:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:05,513 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:03:05,513 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:03:05,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:05,514 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:05,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 236 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:03:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-12 19:03:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 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:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-07-12 19:03:05,517 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2022-07-12 19:03:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:05,518 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-07-12 19:03:05,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-07-12 19:03:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:03:05,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:05,519 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, 1, 1, 1] [2022-07-12 19:03:05,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:03:05,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:05,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2022-07-12 19:03:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:05,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612813717] [2022-07-12 19:03:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:05,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:05,639 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:05,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:05,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612813717] [2022-07-12 19:03:05,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612813717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:05,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:05,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:03:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658086097] [2022-07-12 19:03:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:05,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:03:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:03:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:05,641 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:06,056 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-07-12 19:03:06,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:03:06,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:03:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:06,058 INFO L225 Difference]: With dead ends: 185 [2022-07-12 19:03:06,058 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 19:03:06,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:03:06,058 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:06,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 340 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 19:03:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2022-07-12 19:03:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2022-07-12 19:03:06,062 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2022-07-12 19:03:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:06,062 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2022-07-12 19:03:06,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2022-07-12 19:03:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:03:06,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:06,063 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, 1, 1, 1] [2022-07-12 19:03:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:03:06,063 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2022-07-12 19:03:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:06,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608666993] [2022-07-12 19:03:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:06,263 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:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:06,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608666993] [2022-07-12 19:03:06,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608666993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:06,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:03:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743649809] [2022-07-12 19:03:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:03:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:03:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:06,265 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:06,696 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-07-12 19:03:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:03:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:03:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:06,697 INFO L225 Difference]: With dead ends: 217 [2022-07-12 19:03:06,697 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 19:03:06,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:03:06,699 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 217 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:06,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 341 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 19:03:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2022-07-12 19:03:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-07-12 19:03:06,703 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2022-07-12 19:03:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:06,703 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-07-12 19:03:06,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-07-12 19:03:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:03:06,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:06,704 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, 1, 1, 1, 1, 1] [2022-07-12 19:03:06,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:03:06,705 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2022-07-12 19:03:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:06,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605996626] [2022-07-12 19:03:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:06,913 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:06,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:06,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605996626] [2022-07-12 19:03:06,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605996626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:06,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:06,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:03:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232502093] [2022-07-12 19:03:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:06,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:03:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:03:06,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:06,915 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:07,502 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-07-12 19:03:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:03:07,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:03:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:07,504 INFO L225 Difference]: With dead ends: 215 [2022-07-12 19:03:07,504 INFO L226 Difference]: Without dead ends: 215 [2022-07-12 19:03:07,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:03:07,505 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 301 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:07,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 477 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-12 19:03:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2022-07-12 19:03:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-07-12 19:03:07,508 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 30 [2022-07-12 19:03:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:07,508 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-07-12 19:03:07,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-07-12 19:03:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:03:07,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:07,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:07,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:03:07,509 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash -245371248, now seen corresponding path program 1 times [2022-07-12 19:03:07,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:07,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353147758] [2022-07-12 19:03:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:07,546 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:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:07,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353147758] [2022-07-12 19:03:07,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353147758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:07,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:07,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:07,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843851115] [2022-07-12 19:03:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:07,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:07,549 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:07,639 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-07-12 19:03:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 19:03:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:07,640 INFO L225 Difference]: With dead ends: 136 [2022-07-12 19:03:07,640 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:03:07,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:07,641 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 21 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:07,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 211 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:03:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-07-12 19:03:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 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:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-07-12 19:03:07,643 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2022-07-12 19:03:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:07,644 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-07-12 19:03:07,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-07-12 19:03:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:03:07,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:07,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:07,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:03:07,645 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 984809453, now seen corresponding path program 1 times [2022-07-12 19:03:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:07,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759992224] [2022-07-12 19:03:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:07,683 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:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:07,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759992224] [2022-07-12 19:03:07,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759992224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:07,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:07,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848038774] [2022-07-12 19:03:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:07,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:07,685 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:07,776 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-07-12 19:03:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:03:07,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 19:03:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:07,777 INFO L225 Difference]: With dead ends: 152 [2022-07-12 19:03:07,777 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 19:03:07,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:07,778 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 135 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:07,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 92 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 19:03:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2022-07-12 19:03:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2022-07-12 19:03:07,781 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2022-07-12 19:03:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:07,781 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2022-07-12 19:03:07,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2022-07-12 19:03:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:03:07,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:07,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:07,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:03:07,782 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash -27234752, now seen corresponding path program 1 times [2022-07-12 19:03:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:07,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517213598] [2022-07-12 19:03:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:08,185 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:08,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:08,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517213598] [2022-07-12 19:03:08,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517213598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:08,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740854909] [2022-07-12 19:03:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:08,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:08,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:08,187 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:08,188 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:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:08,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 19:03:08,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:08,411 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:08,448 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:08,501 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:03:08,501 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:08,567 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:08,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:08,577 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:08,709 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:08,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, 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:03:08,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 20 treesize of output 22 [2022-07-12 19:03:08,752 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:08,811 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 16 treesize of output 18 [2022-07-12 19:03:08,859 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 16 treesize of output 18 [2022-07-12 19:03:08,884 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 19:03:08,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:03:08,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, 3 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:08,922 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 16 treesize of output 18 [2022-07-12 19:03:09,007 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:09,008 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-12 19:03:09,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:03:09,032 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 24 treesize of output 12 [2022-07-12 19:03:09,042 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 16 treesize of output 18 [2022-07-12 19:03:09,063 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:09,065 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:09,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:09,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-07-12 19:03:09,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-07-12 19:03:09,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-07-12 19:03:09,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-07-12 19:03:09,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:09,137 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 33 treesize of output 34 [2022-07-12 19:03:09,141 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 60 treesize of output 52 [2022-07-12 19:03:09,145 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 24 treesize of output 22 [2022-07-12 19:03:09,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) .cse0) (forall ((v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (or (not .cse0) (forall ((v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0))))) is different from false [2022-07-12 19:03:09,622 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_865) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0)))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (or (forall ((v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_865) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) (not (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) 0))))) is different from false [2022-07-12 19:03:09,643 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (or (not (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) 0)) (forall ((v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_865) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_872)) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0)) (= (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_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= 0 (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse1 v_ArrVal_865) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_866) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_869)) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))))) is different from false [2022-07-12 19:03:09,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:09,677 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 63 treesize of output 55 [2022-07-12 19:03:09,681 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 104 treesize of output 92 [2022-07-12 19:03:09,686 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 57 treesize of output 53 [2022-07-12 19:03:09,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:09,759 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 60 treesize of output 52 [2022-07-12 19:03:09,763 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 97 treesize of output 85 [2022-07-12 19:03:09,768 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 42 treesize of output 38 [2022-07-12 19:03:17,933 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 103 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:03:17,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:17,981 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 7 [2022-07-12 19:03:17,984 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 12 treesize of output 8 [2022-07-12 19:03:17,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:18,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:18,003 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 2 case distinctions, treesize of input 60 treesize of output 52 [2022-07-12 19:03:18,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:18,012 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 165 treesize of output 141 [2022-07-12 19:03:18,023 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 29 treesize of output 21 [2022-07-12 19:03:18,028 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 36 treesize of output 24 [2022-07-12 19:03:18,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:18,047 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 7 [2022-07-12 19:03:18,051 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 12 treesize of output 8 [2022-07-12 19:03:18,055 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 12 treesize of output 8 [2022-07-12 19:03:18,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:18,087 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 19:03:18,088 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2022-07-12 19:03:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740854909] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:18,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:18,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 19] total 42 [2022-07-12 19:03:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584702841] [2022-07-12 19:03:18,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:18,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 19:03:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:18,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 19:03:18,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=972, Unknown=19, NotChecked=504, Total=1722 [2022-07-12 19:03:18,206 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 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:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:20,430 INFO L93 Difference]: Finished difference Result 359 states and 371 transitions. [2022-07-12 19:03:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 19:03:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 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) Word has length 37 [2022-07-12 19:03:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:20,433 INFO L225 Difference]: With dead ends: 359 [2022-07-12 19:03:20,433 INFO L226 Difference]: Without dead ends: 359 [2022-07-12 19:03:20,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=527, Invalid=2442, Unknown=29, NotChecked=784, Total=3782 [2022-07-12 19:03:20,435 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 515 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 3757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2549 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:20,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1433 Invalid, 3757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1142 Invalid, 0 Unknown, 2549 Unchecked, 0.7s Time] [2022-07-12 19:03:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-12 19:03:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 178. [2022-07-12 19:03:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 177 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:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2022-07-12 19:03:20,439 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 37 [2022-07-12 19:03:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:20,439 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2022-07-12 19:03:20,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 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:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-07-12 19:03:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:03:20,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:20,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:20,468 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:20,663 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:20,664 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 421565270, now seen corresponding path program 1 times [2022-07-12 19:03:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:20,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469507336] [2022-07-12 19:03:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:20,834 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,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:20,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469507336] [2022-07-12 19:03:20,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469507336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:20,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:20,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:03:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700087926] [2022-07-12 19:03:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:03:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:03:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:20,836 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:21,252 INFO L93 Difference]: Finished difference Result 237 states and 244 transitions. [2022-07-12 19:03:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:03:21,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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 38 [2022-07-12 19:03:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:21,253 INFO L225 Difference]: With dead ends: 237 [2022-07-12 19:03:21,253 INFO L226 Difference]: Without dead ends: 237 [2022-07-12 19:03:21,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:03:21,254 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 193 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:21,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 408 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-12 19:03:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 187. [2022-07-12 19:03:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 186 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2022-07-12 19:03:21,258 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 38 [2022-07-12 19:03:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:21,258 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2022-07-12 19:03:21,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2022-07-12 19:03:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:03:21,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:21,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:21,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:03:21,264 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash 183621750, now seen corresponding path program 1 times [2022-07-12 19:03:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090022488] [2022-07-12 19:03:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:21,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:21,451 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,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:21,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090022488] [2022-07-12 19:03:21,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090022488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:21,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:21,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:03:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843925656] [2022-07-12 19:03:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:21,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:03:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:03:21,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:21,455 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:21,852 INFO L93 Difference]: Finished difference Result 236 states and 243 transitions. [2022-07-12 19:03:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:03:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:03:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:21,853 INFO L225 Difference]: With dead ends: 236 [2022-07-12 19:03:21,853 INFO L226 Difference]: Without dead ends: 236 [2022-07-12 19:03:21,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:03:21,854 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 207 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:21,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 330 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-12 19:03:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2022-07-12 19:03:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 164 states have (on average 1.225609756097561) internal successors, (201), 187 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2022-07-12 19:03:21,858 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 39 [2022-07-12 19:03:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:21,858 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2022-07-12 19:03:21,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2022-07-12 19:03:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:03:21,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:21,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:21,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 19:03:21,859 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086814, now seen corresponding path program 1 times [2022-07-12 19:03:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:21,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250779700] [2022-07-12 19:03:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,122 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:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:22,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250779700] [2022-07-12 19:03:22,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250779700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:22,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872536397] [2022-07-12 19:03:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:22,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:22,127 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:22,128 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:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 19:03:22,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:22,339 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:22,340 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:03:22,372 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:22,458 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:22,458 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 19 treesize of output 22 [2022-07-12 19:03:22,503 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:22,504 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 19 treesize of output 22 [2022-07-12 19:03:22,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:22,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:22,859 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 25 treesize of output 16 [2022-07-12 19:03:22,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:03:22,880 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:22,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:22,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:22,948 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 25 treesize of output 29 [2022-07-12 19:03:23,109 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2022-07-12 19:03:23,128 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (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_1064) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (let ((.cse0 (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_1064) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|) (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2022-07-12 19:03:23,165 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1063))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1063))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2022-07-12 19:03:23,187 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (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_1063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse1 (select (let ((.cse2 (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_1063))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_63|) (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-12 19:03:23,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:23,223 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:03:23,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:23,233 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 245 treesize of output 220 [2022-07-12 19:03:23,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:23,246 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 204 treesize of output 197 [2022-07-12 19:03:23,252 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 188 treesize of output 180 [2022-07-12 19:03:23,396 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:03:23,396 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 69 treesize of output 1 [2022-07-12 19:03:23,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:23,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 87 [2022-07-12 19:03:23,704 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:23,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872536397] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:23,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:23,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2022-07-12 19:03:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102208801] [2022-07-12 19:03:23,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 19:03:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 19:03:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1165, Unknown=4, NotChecked=292, Total=1640 [2022-07-12 19:03:23,706 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 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:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,607 INFO L93 Difference]: Finished difference Result 218 states and 227 transitions. [2022-07-12 19:03:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 19:03:24,608 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 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) Word has length 39 [2022-07-12 19:03:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,609 INFO L225 Difference]: With dead ends: 218 [2022-07-12 19:03:24,609 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 19:03:24,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=383, Invalid=1885, Unknown=4, NotChecked=380, Total=2652 [2022-07-12 19:03:24,610 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 234 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 847 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1084 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1048 Invalid, 0 Unknown, 847 Unchecked, 0.5s Time] [2022-07-12 19:03:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 19:03:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2022-07-12 19:03:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.223529411764706) internal successors, (208), 193 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2022-07-12 19:03:24,614 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 39 [2022-07-12 19:03:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,614 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2022-07-12 19:03:24,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 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:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-07-12 19:03:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:03:24,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 19:03:24,827 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,SelfDestructingSolverStorable24 [2022-07-12 19:03:24,828 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086815, now seen corresponding path program 1 times [2022-07-12 19:03:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334572544] [2022-07-12 19:03:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,951 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:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334572544] [2022-07-12 19:03:24,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334572544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:24,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931201791] [2022-07-12 19:03:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:24,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:24,953 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:24,954 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:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:03:25,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:25,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:25,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 19:03:25,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:25,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:25,347 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 28 treesize of output 19 [2022-07-12 19:03:25,362 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,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:25,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:25,416 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 34 treesize of output 38 [2022-07-12 19:03:25,500 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 19:03:25,500 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 11 treesize of output 11 [2022-07-12 19:03:25,513 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 19:03:25,514 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 38 treesize of output 29 [2022-07-12 19:03:25,615 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,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931201791] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:25,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:25,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-07-12 19:03:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022641437] [2022-07-12 19:03:25,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:03:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:03:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:03:25,617 INFO L87 Difference]: Start difference. First operand 194 states and 208 transitions. Second operand has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,027 INFO L93 Difference]: Finished difference Result 228 states and 240 transitions. [2022-07-12 19:03:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:03:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 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 39 [2022-07-12 19:03:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,028 INFO L225 Difference]: With dead ends: 228 [2022-07-12 19:03:26,028 INFO L226 Difference]: Without dead ends: 228 [2022-07-12 19:03:26,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:03:26,029 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 127 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 635 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 480 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2022-07-12 19:03:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-12 19:03:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 204. [2022-07-12 19:03:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 203 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2022-07-12 19:03:26,033 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 39 [2022-07-12 19:03:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,033 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2022-07-12 19:03:26,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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,033 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2022-07-12 19:03:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:03:26,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:26,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:26,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:26,247 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1397307224, now seen corresponding path program 1 times [2022-07-12 19:03:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63340313] [2022-07-12 19:03:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,310 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,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63340313] [2022-07-12 19:03:26,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63340313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:26,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627970654] [2022-07-12 19:03:26,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:26,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:26,312 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 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:03:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,598 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2022-07-12 19:03:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:03:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 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 40 [2022-07-12 19:03:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,600 INFO L225 Difference]: With dead ends: 227 [2022-07-12 19:03:26,600 INFO L226 Difference]: Without dead ends: 227 [2022-07-12 19:03:26,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:26,601 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 302 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-12 19:03:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2022-07-12 19:03:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 190 states have (on average 1.2157894736842105) internal successors, (231), 210 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2022-07-12 19:03:26,604 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 40 [2022-07-12 19:03:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,605 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2022-07-12 19:03:26,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 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:03:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2022-07-12 19:03:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:03:26,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:26,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 19:03:26,606 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-12 19:03:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 402357860, now seen corresponding path program 1 times [2022-07-12 19:03:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361862877] [2022-07-12 19:03:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,173 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:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361862877] [2022-07-12 19:03:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361862877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587181547] [2022-07-12 19:03:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:27,179 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:27,180 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:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 19:03:27,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:27,310 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,387 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:27,387 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:03:27,432 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:27,506 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,506 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 19 treesize of output 22 [2022-07-12 19:03:27,595 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,598 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 22 treesize of output 22 [2022-07-12 19:03:27,662 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:27,663 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 22 treesize of output 22 [2022-07-12 19:03:27,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:27,681 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 19:03:27,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:03:27,733 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:03:27,733 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 19:03:27,831 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 19:03:27,832 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 42 treesize of output 44 [2022-07-12 19:03:27,905 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 19:03:27,905 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-07-12 19:03:28,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:28,088 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-12 19:03:28,089 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2022-07-12 19:03:28,094 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,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:28,482 INFO L356 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-07-12 19:03:28,482 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 45 treesize of output 44 [2022-07-12 19:03:28,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-07-12 19:03:28,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:28,576 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-12 19:03:28,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_1346))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-07-12 19:03:29,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,054 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 134 treesize of output 86 [2022-07-12 19:03:29,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,071 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 5582 treesize of output 4889 [2022-07-12 19:03:29,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,131 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 4874 treesize of output 4416 [2022-07-12 19:03:29,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,164 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 4394 treesize of output 3540 [2022-07-12 19:03:29,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:29,204 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 3526 treesize of output 3246 [2022-07-12 19:03:29,232 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 3238 treesize of output 3110 [2022-07-12 19:03:29,307 INFO L356 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-07-12 19:03:29,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61