./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:04:09,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:04:09,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:04:09,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:04:09,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:04:09,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:04:09,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:04:09,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:04:09,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:04:09,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:04:09,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:04:09,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:04:09,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:04:09,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:04:09,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:04:09,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:04:09,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:04:09,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:04:09,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:04:09,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:04:09,876 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:04:09,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:04:09,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:04:09,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:04:09,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:04:09,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:04:09,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:04:09,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:04:09,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:04:09,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:04:09,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:04:09,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:04:09,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:04:09,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:04:09,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:04:09,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:04:09,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:04:09,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:04:09,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:04:09,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:04:09,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:04:09,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:04:09,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:04:09,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:04:09,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:04:09,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:04:09,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:04:09,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:04:09,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:04:09,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:04:09,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:04:09,933 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:04:09,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:04:09,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:04:09,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:04:09,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:04:09,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:04:09,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:04:09,942 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:04:09,942 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:04:09,942 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:04:09,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:04:09,943 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:04:09,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:04:09,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:04:09,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:04:09,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:04:09,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:04:09,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:04:09,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:04:09,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:04:09,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:04:09,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:04:09,945 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2022-07-21 17:04:10,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:04:10,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:04:10,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:04:10,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:04:10,286 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:04:10,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-07-21 17:04:10,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f398c49/4000b1cf193c405cabaf7b4ef2443018/FLAGc558343d9 [2022-07-21 17:04:10,746 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:04:10,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-07-21 17:04:10,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f398c49/4000b1cf193c405cabaf7b4ef2443018/FLAGc558343d9 [2022-07-21 17:04:11,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f398c49/4000b1cf193c405cabaf7b4ef2443018 [2022-07-21 17:04:11,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:04:11,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:04:11,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:04:11,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:04:11,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:04:11,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9455de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11, skipping insertion in model container [2022-07-21 17:04:11,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:04:11,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:04:11,298 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-07-21 17:04:11,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:04:11,339 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:04:11,370 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-07-21 17:04:11,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:04:11,398 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:04:11,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11 WrapperNode [2022-07-21 17:04:11,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:04:11,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:04:11,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:04:11,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:04:11,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,426 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2022-07-21 17:04:11,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:04:11,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:04:11,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:04:11,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:04:11,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:04:11,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:04:11,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:04:11,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:04:11,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (1/1) ... [2022-07-21 17:04:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:04:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:11,496 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-21 17:04:11,520 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-21 17:04:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:04:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 17:04:11,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 17:04:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:04:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-07-21 17:04:11,537 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-07-21 17:04:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:04:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:04:11,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:04:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:04:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 17:04:11,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 17:04:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:04:11,627 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:04:11,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:04:11,853 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:04:11,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:04:11,858 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 17:04:11,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:04:11 BoogieIcfgContainer [2022-07-21 17:04:11,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:04:11,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:04:11,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:04:11,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:04:11,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:04:11" (1/3) ... [2022-07-21 17:04:11,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e850b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:04:11, skipping insertion in model container [2022-07-21 17:04:11,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:04:11" (2/3) ... [2022-07-21 17:04:11,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e850b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:04:11, skipping insertion in model container [2022-07-21 17:04:11,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:04:11" (3/3) ... [2022-07-21 17:04:11,866 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-07-21 17:04:11,878 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:04:11,878 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-07-21 17:04:11,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:04:11,920 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@e030bc7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1586d1dd [2022-07-21 17:04:11,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-21 17:04:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.6) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:04:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:04:11,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:11,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:11,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash -724999257, now seen corresponding path program 1 times [2022-07-21 17:04:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:11,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833536132] [2022-07-21 17:04:11,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:12,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:12,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833536132] [2022-07-21 17:04:12,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833536132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:12,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:12,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:04:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652216827] [2022-07-21 17:04:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:12,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 17:04:12,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 17:04:12,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 17:04:12,139 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.6) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:04:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:12,159 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-21 17:04:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 17:04:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-07-21 17:04:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:12,167 INFO L225 Difference]: With dead ends: 64 [2022-07-21 17:04:12,167 INFO L226 Difference]: Without dead ends: 62 [2022-07-21 17:04:12,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 17:04:12,178 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:12,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:04:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-21 17:04:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-21 17:04:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:04:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-21 17:04:12,217 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2022-07-21 17:04:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:12,217 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-21 17:04:12,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:04:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-21 17:04:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:04:12,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:12,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:04:12,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1833988771, now seen corresponding path program 1 times [2022-07-21 17:04:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:12,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522271468] [2022-07-21 17:04:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:12,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522271468] [2022-07-21 17:04:12,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522271468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:12,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:12,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:04:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843651888] [2022-07-21 17:04:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:04:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:04:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:04:12,360 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:04:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:12,501 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-21 17:04:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:04:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-21 17:04:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:12,510 INFO L225 Difference]: With dead ends: 106 [2022-07-21 17:04:12,510 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 17:04:12,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:04:12,511 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 47 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:12,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 17:04:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2022-07-21 17:04:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.56) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 17:04:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-07-21 17:04:12,530 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 22 [2022-07-21 17:04:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:12,534 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-07-21 17:04:12,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:04:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-07-21 17:04:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:04:12,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:12,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:12,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:04:12,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1832511589, now seen corresponding path program 1 times [2022-07-21 17:04:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:12,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868875512] [2022-07-21 17:04:12,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:12,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868875512] [2022-07-21 17:04:12,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868875512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:12,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:12,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:04:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449776747] [2022-07-21 17:04:12,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:12,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:04:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:04:12,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:04:12,650 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:12,729 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-07-21 17:04:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:04:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-07-21 17:04:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:12,734 INFO L225 Difference]: With dead ends: 82 [2022-07-21 17:04:12,737 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 17:04:12,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-21 17:04:12,738 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:12,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 17:04:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-21 17:04:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.5) internal successors, (75), 64 states have internal predecessors, (75), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 17:04:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-21 17:04:12,749 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 22 [2022-07-21 17:04:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:12,750 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-21 17:04:12,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-21 17:04:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:04:12,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:12,751 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:12,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:04:12,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1832511590, now seen corresponding path program 1 times [2022-07-21 17:04:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:12,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528310363] [2022-07-21 17:04:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:04:12,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:12,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528310363] [2022-07-21 17:04:12,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528310363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:12,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:12,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:04:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984104420] [2022-07-21 17:04:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:12,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:04:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:04:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:04:12,911 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:13,035 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-07-21 17:04:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:04:13,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-07-21 17:04:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:13,040 INFO L225 Difference]: With dead ends: 80 [2022-07-21 17:04:13,040 INFO L226 Difference]: Without dead ends: 80 [2022-07-21 17:04:13,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:04:13,047 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:13,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 237 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-21 17:04:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-21 17:04:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.46) internal successors, (73), 62 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 17:04:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-07-21 17:04:13,058 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 22 [2022-07-21 17:04:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:13,058 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-07-21 17:04:13,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-07-21 17:04:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:04:13,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:13,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:13,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:04:13,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash 107045159, now seen corresponding path program 1 times [2022-07-21 17:04:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:13,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271353708] [2022-07-21 17:04:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:13,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271353708] [2022-07-21 17:04:13,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271353708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:13,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:13,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:04:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116926497] [2022-07-21 17:04:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:13,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:04:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:04:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:04:13,212 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:13,356 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2022-07-21 17:04:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:04:13,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-07-21 17:04:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:13,358 INFO L225 Difference]: With dead ends: 119 [2022-07-21 17:04:13,358 INFO L226 Difference]: Without dead ends: 119 [2022-07-21 17:04:13,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:04:13,359 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:13,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 257 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-21 17:04:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2022-07-21 17:04:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-21 17:04:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2022-07-21 17:04:13,369 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 24 [2022-07-21 17:04:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:13,370 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2022-07-21 17:04:13,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-07-21 17:04:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:04:13,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:13,371 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:04:13,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1801661154, now seen corresponding path program 1 times [2022-07-21 17:04:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:13,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019696639] [2022-07-21 17:04:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:13,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019696639] [2022-07-21 17:04:13,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019696639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:13,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:04:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086485115] [2022-07-21 17:04:13,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:13,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:04:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:13,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:04:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:04:13,536 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:13,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:13,722 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-07-21 17:04:13,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:04:13,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-07-21 17:04:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:13,723 INFO L225 Difference]: With dead ends: 90 [2022-07-21 17:04:13,724 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 17:04:13,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:04:13,725 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 43 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:13,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 412 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 17:04:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-21 17:04:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.396551724137931) internal successors, (81), 70 states have internal predecessors, (81), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-21 17:04:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-21 17:04:13,731 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 29 [2022-07-21 17:04:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:13,731 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-21 17:04:13,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:04:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-21 17:04:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:04:13,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:13,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:13,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:04:13,732 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1023324068, now seen corresponding path program 1 times [2022-07-21 17:04:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:13,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103964207] [2022-07-21 17:04:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:13,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103964207] [2022-07-21 17:04:13,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103964207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:13,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:13,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:04:13,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470718566] [2022-07-21 17:04:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:13,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:04:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:04:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:04:13,848 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:14,057 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-07-21 17:04:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:04:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-21 17:04:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:14,058 INFO L225 Difference]: With dead ends: 110 [2022-07-21 17:04:14,058 INFO L226 Difference]: Without dead ends: 110 [2022-07-21 17:04:14,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:04:14,059 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:14,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 197 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:04:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-21 17:04:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2022-07-21 17:04:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 70 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-21 17:04:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-21 17:04:14,066 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 30 [2022-07-21 17:04:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:14,066 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-21 17:04:14,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-21 17:04:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:04:14,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:14,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:14,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:04:14,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1023324067, now seen corresponding path program 1 times [2022-07-21 17:04:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:14,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474130182] [2022-07-21 17:04:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:14,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474130182] [2022-07-21 17:04:14,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474130182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:14,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:14,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:04:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594573992] [2022-07-21 17:04:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:14,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:04:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:04:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:04:14,140 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:14,224 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-07-21 17:04:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:04:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-21 17:04:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:14,226 INFO L225 Difference]: With dead ends: 86 [2022-07-21 17:04:14,226 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 17:04:14,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:04:14,226 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:14,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 121 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 17:04:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-21 17:04:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 66 states have internal predecessors, (72), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-21 17:04:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-07-21 17:04:14,232 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 30 [2022-07-21 17:04:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:14,232 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-07-21 17:04:14,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-07-21 17:04:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:04:14,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:14,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:14,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:04:14,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1658275025, now seen corresponding path program 1 times [2022-07-21 17:04:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:14,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087240888] [2022-07-21 17:04:14,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:14,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087240888] [2022-07-21 17:04:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087240888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:14,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:14,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:04:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735615054] [2022-07-21 17:04:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:14,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:04:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:04:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:04:14,345 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:14,568 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-21 17:04:14,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:04:14,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-07-21 17:04:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:14,570 INFO L225 Difference]: With dead ends: 99 [2022-07-21 17:04:14,570 INFO L226 Difference]: Without dead ends: 99 [2022-07-21 17:04:14,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:04:14,570 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:14,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:04:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-21 17:04:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2022-07-21 17:04:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 66 states have internal predecessors, (71), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-21 17:04:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-07-21 17:04:14,584 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 31 [2022-07-21 17:04:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:14,585 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-07-21 17:04:14,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-07-21 17:04:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:04:14,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:14,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-21 17:04:14,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:04:14,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash 922787578, now seen corresponding path program 1 times [2022-07-21 17:04:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:14,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715993914] [2022-07-21 17:04:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 17:04:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715993914] [2022-07-21 17:04:14,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715993914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:14,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:14,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:04:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466591373] [2022-07-21 17:04:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:14,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:04:14,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:14,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:04:14,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:04:14,664 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:14,686 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-07-21 17:04:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:04:14,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-07-21 17:04:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:14,688 INFO L225 Difference]: With dead ends: 85 [2022-07-21 17:04:14,688 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 17:04:14,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-21 17:04:14,689 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:14,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:04:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 17:04:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-21 17:04:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.206896551724138) internal successors, (70), 65 states have internal predecessors, (70), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-21 17:04:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2022-07-21 17:04:14,700 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 32 [2022-07-21 17:04:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:14,701 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2022-07-21 17:04:14,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2022-07-21 17:04:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:04:14,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:14,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-21 17:04:14,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:04:14,706 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2035601245, now seen corresponding path program 1 times [2022-07-21 17:04:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:14,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193554844] [2022-07-21 17:04:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 17:04:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:04:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:14,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193554844] [2022-07-21 17:04:14,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193554844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:14,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:04:14,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:04:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177435306] [2022-07-21 17:04:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:14,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:04:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:04:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:04:14,788 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:14,842 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-07-21 17:04:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:04:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-21 17:04:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:14,844 INFO L225 Difference]: With dead ends: 84 [2022-07-21 17:04:14,844 INFO L226 Difference]: Without dead ends: 70 [2022-07-21 17:04:14,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:04:14,844 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:14,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:04:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-21 17:04:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-21 17:04:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-21 17:04:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-07-21 17:04:14,849 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-07-21 17:04:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:14,849 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-07-21 17:04:14,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-07-21 17:04:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:04:14,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:14,850 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:14,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:04:14,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 287149833, now seen corresponding path program 1 times [2022-07-21 17:04:14,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:14,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816534281] [2022-07-21 17:04:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:14,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816534281] [2022-07-21 17:04:14,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816534281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783198354] [2022-07-21 17:04:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:14,951 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-21 17:04:14,991 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-21 17:04:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 17:04:15,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:15,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:04:15,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783198354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:04:15,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:04:15,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2022-07-21 17:04:15,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724625744] [2022-07-21 17:04:15,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:04:15,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:04:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:04:15,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:04:15,211 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:15,360 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-07-21 17:04:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:04:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-07-21 17:04:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:15,365 INFO L225 Difference]: With dead ends: 87 [2022-07-21 17:04:15,365 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 17:04:15,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:04:15,366 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:15,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 222 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:04:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 17:04:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-07-21 17:04:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 56 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-21 17:04:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-21 17:04:15,373 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 39 [2022-07-21 17:04:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:15,373 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-21 17:04:15,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:04:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-21 17:04:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:04:15,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:15,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:15,402 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-21 17:04:15,591 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,SelfDestructingSolverStorable11 [2022-07-21 17:04:15,592 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 285681908, now seen corresponding path program 1 times [2022-07-21 17:04:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:15,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264070069] [2022-07-21 17:04:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 17:04:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 17:04:15,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:15,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264070069] [2022-07-21 17:04:15,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264070069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:15,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101058746] [2022-07-21 17:04:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:15,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:15,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:15,731 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-21 17:04:15,733 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-21 17:04:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:15,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:04:15,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 17:04:16,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:04:16,222 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 30 treesize of output 26 [2022-07-21 17:04:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 17:04:16,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101058746] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:04:16,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:04:16,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-07-21 17:04:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912496318] [2022-07-21 17:04:16,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:04:16,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 17:04:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 17:04:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:04:16,452 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-21 17:04:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:16,998 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2022-07-21 17:04:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:04:16,999 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 39 [2022-07-21 17:04:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:17,000 INFO L225 Difference]: With dead ends: 148 [2022-07-21 17:04:17,000 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 17:04:17,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 17:04:17,001 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 119 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:17,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 467 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 409 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-07-21 17:04:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 17:04:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2022-07-21 17:04:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 92 states have internal predecessors, (102), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (27), 19 states have call predecessors, (27), 22 states have call successors, (27) [2022-07-21 17:04:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-07-21 17:04:17,008 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 39 [2022-07-21 17:04:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:17,008 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-07-21 17:04:17,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-21 17:04:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-07-21 17:04:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:04:17,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:17,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:17,034 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-21 17:04:17,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 17:04:17,223 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash -337593259, now seen corresponding path program 1 times [2022-07-21 17:04:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:17,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856577947] [2022-07-21 17:04:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 17:04:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:17,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856577947] [2022-07-21 17:04:17,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856577947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:17,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124083142] [2022-07-21 17:04:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:17,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:17,405 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-21 17:04:17,432 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-21 17:04:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:17,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 17:04:17,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:17,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:04:18,044 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 31 treesize of output 27 [2022-07-21 17:04:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:18,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124083142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:04:18,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:04:18,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2022-07-21 17:04:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089974025] [2022-07-21 17:04:18,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:04:18,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 17:04:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:18,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 17:04:18,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 17:04:18,202 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-21 17:04:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:19,726 INFO L93 Difference]: Finished difference Result 278 states and 351 transitions. [2022-07-21 17:04:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 17:04:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 41 [2022-07-21 17:04:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:19,729 INFO L225 Difference]: With dead ends: 278 [2022-07-21 17:04:19,729 INFO L226 Difference]: Without dead ends: 278 [2022-07-21 17:04:19,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=477, Invalid=3555, Unknown=0, NotChecked=0, Total=4032 [2022-07-21 17:04:19,731 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 317 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:19,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 733 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1013 Invalid, 0 Unknown, 258 Unchecked, 0.6s Time] [2022-07-21 17:04:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-21 17:04:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2022-07-21 17:04:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 127 states have internal predecessors, (144), 29 states have call successors, (29), 11 states have call predecessors, (29), 16 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-21 17:04:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2022-07-21 17:04:19,742 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 218 transitions. Word has length 41 [2022-07-21 17:04:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:19,743 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 218 transitions. [2022-07-21 17:04:19,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-21 17:04:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2022-07-21 17:04:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:04:19,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:19,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2022-07-21 17:04:19,767 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-21 17:04:19,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:19,960 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -525112999, now seen corresponding path program 1 times [2022-07-21 17:04:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:19,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371906094] [2022-07-21 17:04:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:19,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 17:04:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:20,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371906094] [2022-07-21 17:04:20,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371906094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:20,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557787173] [2022-07-21 17:04:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:20,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:20,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:20,118 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-21 17:04:20,129 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-21 17:04:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:20,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:04:20,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:20,197 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 7 treesize of output 6 [2022-07-21 17:04:22,213 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_5))) is different from true [2022-07-21 17:04:24,246 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2022-07-21 17:04:26,268 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_7))) is different from true [2022-07-21 17:04:26,327 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 29 treesize of output 23 [2022-07-21 17:04:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-07-21 17:04:26,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:04:28,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557787173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:28,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:04:28,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 22 [2022-07-21 17:04:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863549434] [2022-07-21 17:04:28,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:04:28,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 17:04:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 17:04:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=492, Unknown=3, NotChecked=138, Total=702 [2022-07-21 17:04:28,550 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 17:04:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:28,816 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2022-07-21 17:04:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:04:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-07-21 17:04:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:28,820 INFO L225 Difference]: With dead ends: 169 [2022-07-21 17:04:28,820 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 17:04:28,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=125, Invalid=814, Unknown=3, NotChecked=180, Total=1122 [2022-07-21 17:04:28,821 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:28,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 308 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 253 Invalid, 0 Unknown, 282 Unchecked, 0.1s Time] [2022-07-21 17:04:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 17:04:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-21 17:04:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.228813559322034) internal successors, (145), 128 states have internal predecessors, (145), 29 states have call successors, (29), 12 states have call predecessors, (29), 17 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-21 17:04:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2022-07-21 17:04:28,831 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 46 [2022-07-21 17:04:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:28,832 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2022-07-21 17:04:28,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 17:04:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2022-07-21 17:04:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:04:28,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:28,833 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:28,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:04:29,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-21 17:04:29,056 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1395918346, now seen corresponding path program 1 times [2022-07-21 17:04:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405033757] [2022-07-21 17:04:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 17:04:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 17:04:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 17:04:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:29,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405033757] [2022-07-21 17:04:29,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405033757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289861553] [2022-07-21 17:04:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:29,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:29,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:29,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:04:29,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:04:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:29,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:04:29,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:29,243 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-21 17:04:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:29,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:04:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 17:04:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289861553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:04:30,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:04:30,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-07-21 17:04:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384866663] [2022-07-21 17:04:30,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:04:30,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 17:04:30,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 17:04:30,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:04:30,007 INFO L87 Difference]: Start difference. First operand 169 states and 219 transitions. Second operand has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-21 17:04:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:30,546 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-07-21 17:04:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:04:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2022-07-21 17:04:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:30,548 INFO L225 Difference]: With dead ends: 244 [2022-07-21 17:04:30,548 INFO L226 Difference]: Without dead ends: 244 [2022-07-21 17:04:30,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2022-07-21 17:04:30,549 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 218 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:30,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 352 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 476 Invalid, 0 Unknown, 58 Unchecked, 0.4s Time] [2022-07-21 17:04:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-21 17:04:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 172. [2022-07-21 17:04:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 130 states have internal predecessors, (145), 29 states have call successors, (29), 13 states have call predecessors, (29), 18 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-21 17:04:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2022-07-21 17:04:30,556 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 47 [2022-07-21 17:04:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:30,556 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2022-07-21 17:04:30,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-21 17:04:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2022-07-21 17:04:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:04:30,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:30,557 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:30,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:04:30,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 17:04:30,758 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 323795755, now seen corresponding path program 1 times [2022-07-21 17:04:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:30,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579987435] [2022-07-21 17:04:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:04:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:04:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 17:04:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 17:04:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 17:04:30,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:30,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579987435] [2022-07-21 17:04:30,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579987435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:30,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427012578] [2022-07-21 17:04:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:30,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:30,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:30,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:04:30,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 17:04:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:30,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-21 17:04:30,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:30,957 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-21 17:04:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 17:04:31,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:04:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 17:04:31,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427012578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:04:31,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:04:31,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-21 17:04:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970568994] [2022-07-21 17:04:31,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:04:31,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 17:04:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 17:04:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:04:31,705 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-21 17:04:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:32,411 INFO L93 Difference]: Finished difference Result 273 states and 335 transitions. [2022-07-21 17:04:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:04:32,414 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 48 [2022-07-21 17:04:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:32,415 INFO L225 Difference]: With dead ends: 273 [2022-07-21 17:04:32,415 INFO L226 Difference]: Without dead ends: 273 [2022-07-21 17:04:32,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 17:04:32,416 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 294 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:32,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 484 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 641 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2022-07-21 17:04:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-21 17:04:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 178. [2022-07-21 17:04:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 128 states have (on average 1.171875) internal successors, (150), 134 states have internal predecessors, (150), 28 states have call successors, (28), 15 states have call predecessors, (28), 19 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2022-07-21 17:04:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions. [2022-07-21 17:04:32,425 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 216 transitions. Word has length 48 [2022-07-21 17:04:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:32,425 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 216 transitions. [2022-07-21 17:04:32,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-21 17:04:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 216 transitions. [2022-07-21 17:04:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:04:32,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:32,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:32,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:04:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 17:04:32,640 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2076994669, now seen corresponding path program 1 times [2022-07-21 17:04:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415027997] [2022-07-21 17:04:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:04:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 17:04:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 17:04:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:04:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415027997] [2022-07-21 17:04:32,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415027997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985633537] [2022-07-21 17:04:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:32,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:32,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:04:32,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 17:04:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:32,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 17:04:32,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:32,956 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-21 17:04:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:04:33,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:04:34,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985633537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:34,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:04:34,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-21 17:04:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710195523] [2022-07-21 17:04:34,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:04:34,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:04:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:04:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:04:34,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:04:34,192 INFO L87 Difference]: Start difference. First operand 178 states and 216 transitions. Second operand has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-21 17:04:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:04:34,997 INFO L93 Difference]: Finished difference Result 369 states and 470 transitions. [2022-07-21 17:04:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:04:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2022-07-21 17:04:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:04:35,000 INFO L225 Difference]: With dead ends: 369 [2022-07-21 17:04:35,000 INFO L226 Difference]: Without dead ends: 346 [2022-07-21 17:04:35,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 17:04:35,001 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 127 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:04:35,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 769 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:04:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-21 17:04:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 234. [2022-07-21 17:04:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 177 states have internal predecessors, (208), 32 states have call successors, (32), 15 states have call predecessors, (32), 23 states have return successors, (51), 41 states have call predecessors, (51), 32 states have call successors, (51) [2022-07-21 17:04:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-07-21 17:04:35,011 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 54 [2022-07-21 17:04:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:04:35,011 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-07-21 17:04:35,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-21 17:04:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-07-21 17:04:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:04:35,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:04:35,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:04:35,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:04:35,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:35,232 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:04:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:04:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash 412534293, now seen corresponding path program 1 times [2022-07-21 17:04:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:04:35,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34599910] [2022-07-21 17:04:35,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:35,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:04:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:04:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 17:04:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:04:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:04:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 17:04:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 17:04:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:04:35,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:04:35,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34599910] [2022-07-21 17:04:35,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34599910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:04:35,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64187856] [2022-07-21 17:04:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:04:35,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:04:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:04:35,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:04:35,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 17:04:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:04:35,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:04:35,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:04:35,495 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 7 treesize of output 6 [2022-07-21 17:04:37,501 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) is different from true [2022-07-21 17:05:35,951 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 17:05:50,083 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 17:05:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-07-21 17:05:50,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:05:52,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64187856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:05:52,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:05:52,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2022-07-21 17:05:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162496835] [2022-07-21 17:05:52,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:05:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 17:05:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:05:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 17:05:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=237, Unknown=25, NotChecked=32, Total=342 [2022-07-21 17:05:52,186 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-21 17:06:02,293 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 17:06:40,522 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 17:06:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:06:40,602 INFO L93 Difference]: Finished difference Result 345 states and 437 transitions. [2022-07-21 17:06:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 17:06:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2022-07-21 17:06:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:06:40,604 INFO L225 Difference]: With dead ends: 345 [2022-07-21 17:06:40,604 INFO L226 Difference]: Without dead ends: 329 [2022-07-21 17:06:40,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 124.8s TimeCoverageRelationStatistics Valid=85, Invalid=482, Unknown=37, NotChecked=46, Total=650 [2022-07-21 17:06:40,605 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:06:40,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 326 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 264 Unchecked, 0.1s Time] [2022-07-21 17:06:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-21 17:06:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 232. [2022-07-21 17:06:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 174 states have (on average 1.1781609195402298) internal successors, (205), 175 states have internal predecessors, (205), 32 states have call successors, (32), 16 states have call predecessors, (32), 23 states have return successors, (50), 40 states have call predecessors, (50), 32 states have call successors, (50) [2022-07-21 17:06:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 287 transitions. [2022-07-21 17:06:40,613 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 287 transitions. Word has length 54 [2022-07-21 17:06:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:06:40,613 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 287 transitions. [2022-07-21 17:06:40,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-21 17:06:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 287 transitions. [2022-07-21 17:06:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 17:06:40,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:06:40,614 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:06:40,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:06:40,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:06:40,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:06:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:06:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 806764368, now seen corresponding path program 1 times [2022-07-21 17:06:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:06:40,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47671609] [2022-07-21 17:06:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:06:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:06:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:06:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:06:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:06:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 17:06:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 17:06:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 17:06:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 17:06:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:06:40,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47671609] [2022-07-21 17:06:40,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47671609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:06:40,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150054901] [2022-07-21 17:06:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:06:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:06:40,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:06:40,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:06:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:40,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:06:40,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:06:40,986 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 7 treesize of output 6 [2022-07-21 17:06:43,005 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_28 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_28))) is different from true [2022-07-21 17:06:45,027 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_29 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_29))) is different from true [2022-07-21 17:06:45,064 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 29 treesize of output 23 [2022-07-21 17:06:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:06:45,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:06:45,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150054901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:06:45,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:06:45,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2022-07-21 17:06:45,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861940930] [2022-07-21 17:06:45,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:06:45,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:06:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:06:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:06:45,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=89, Unknown=2, NotChecked=38, Total=156 [2022-07-21 17:06:45,083 INFO L87 Difference]: Start difference. First operand 232 states and 287 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 17:06:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:06:45,127 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2022-07-21 17:06:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:06:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2022-07-21 17:06:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:06:45,129 INFO L225 Difference]: With dead ends: 187 [2022-07-21 17:06:45,129 INFO L226 Difference]: Without dead ends: 187 [2022-07-21 17:06:45,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-07-21 17:06:45,130 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:06:45,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 204 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 155 Unchecked, 0.0s Time] [2022-07-21 17:06:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-21 17:06:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-21 17:06:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 141 states have internal predecessors, (162), 25 states have call successors, (25), 13 states have call predecessors, (25), 19 states have return successors, (38), 32 states have call predecessors, (38), 25 states have call successors, (38) [2022-07-21 17:06:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2022-07-21 17:06:45,135 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 56 [2022-07-21 17:06:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:06:45,136 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2022-07-21 17:06:45,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 17:06:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2022-07-21 17:06:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 17:06:45,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:06:45,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:06:45,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:06:45,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:06:45,348 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:06:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:06:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1896699969, now seen corresponding path program 1 times [2022-07-21 17:06:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:06:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885367169] [2022-07-21 17:06:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:06:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:06:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:06:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:06:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:06:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 17:06:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:06:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:06:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 17:06:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 17:06:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-21 17:06:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:06:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885367169] [2022-07-21 17:06:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885367169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:06:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613928969] [2022-07-21 17:06:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:06:45,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:06:45,660 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:06:45,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 17:06:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:45,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 17:06:45,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:06:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 17:06:46,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:06:46,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613928969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:06:46,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:06:46,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-21 17:06:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427067230] [2022-07-21 17:06:46,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:06:46,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 17:06:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:06:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 17:06:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 17:06:46,705 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-21 17:06:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:06:48,213 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2022-07-21 17:06:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 17:06:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) Word has length 71 [2022-07-21 17:06:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:06:48,215 INFO L225 Difference]: With dead ends: 263 [2022-07-21 17:06:48,215 INFO L226 Difference]: Without dead ends: 234 [2022-07-21 17:06:48,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=441, Invalid=2981, Unknown=0, NotChecked=0, Total=3422 [2022-07-21 17:06:48,216 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 308 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:06:48,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 736 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:06:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-21 17:06:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 170. [2022-07-21 17:06:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 127 states have internal predecessors, (147), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (32), 29 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-21 17:06:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-21 17:06:48,223 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 71 [2022-07-21 17:06:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:06:48,223 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-21 17:06:48,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-21 17:06:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-21 17:06:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 17:06:48,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:06:48,224 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:06:48,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:06:48,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 17:06:48,425 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:06:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:06:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 91261635, now seen corresponding path program 1 times [2022-07-21 17:06:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:06:48,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419546679] [2022-07-21 17:06:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:06:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:06:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:06:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:06:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:06:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 17:06:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:06:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:06:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 17:06:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 17:06:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 17:06:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:06:48,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419546679] [2022-07-21 17:06:48,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419546679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:06:48,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794619404] [2022-07-21 17:06:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:48,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:06:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:06:48,741 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:06:48,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 17:06:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:48,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 17:06:48,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:06:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 17:06:49,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:06:50,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794619404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:06:50,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:06:50,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2022-07-21 17:06:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140393631] [2022-07-21 17:06:50,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:06:50,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 17:06:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:06:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 17:06:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 17:06:50,050 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-21 17:06:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:06:51,121 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-07-21 17:06:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 17:06:51,124 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 71 [2022-07-21 17:06:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:06:51,125 INFO L225 Difference]: With dead ends: 232 [2022-07-21 17:06:51,125 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 17:06:51,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2022-07-21 17:06:51,127 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 239 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:06:51,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 550 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:06:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 17:06:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 170. [2022-07-21 17:06:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 127 states have internal predecessors, (146), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (32), 29 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-21 17:06:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-07-21 17:06:51,133 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 71 [2022-07-21 17:06:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:06:51,133 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-07-21 17:06:51,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-21 17:06:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-07-21 17:06:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 17:06:51,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:06:51,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:06:51,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 17:06:51,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-21 17:06:51,349 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-21 17:06:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:06:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1341702710, now seen corresponding path program 2 times [2022-07-21 17:06:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:06:51,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460079429] [2022-07-21 17:06:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:06:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:06:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:06:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:06:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 17:06:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 17:06:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 17:06:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 17:06:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 17:06:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 17:06:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 17:06:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:06:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-21 17:06:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:06:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460079429] [2022-07-21 17:06:51,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460079429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:06:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114140949] [2022-07-21 17:06:51,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:06:51,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:06:51,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:06:51,460 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:06:51,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 17:06:51,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:06:51,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:06:51,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:06:51,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:06:51,547 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 7 treesize of output 6 [2022-07-21 17:06:53,557 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_34 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_34))) is different from true [2022-07-21 17:06:55,575 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_35 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_35))) is different from true [2022-07-21 17:06:57,598 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_37 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_37))) is different from true [2022-07-21 17:06:59,612 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_38 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_38))) is different from true [2022-07-21 17:06:59,646 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 29 treesize of output 23 [2022-07-21 17:06:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2022-07-21 17:06:59,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:07:01,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114140949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:07:01,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:07:01,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 15 [2022-07-21 17:07:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219360738] [2022-07-21 17:07:01,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:07:01,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 17:07:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:07:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 17:07:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=152, Unknown=4, NotChecked=108, Total=306 [2022-07-21 17:07:01,717 INFO L87 Difference]: Start difference. First operand 170 states and 202 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 17:07:03,746 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_check_~a.base_BEFORE_CALL_37 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_37))) (exists ((v_check_~a.base_BEFORE_CALL_34 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_34)))) is different from true [2022-07-21 17:07:05,755 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_check_~a.base_BEFORE_CALL_38 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_38))) (exists ((v_check_~a.base_BEFORE_CALL_35 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_35)))) is different from true [2022-07-21 17:07:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:07:05,786 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-21 17:07:05,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:07:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 73 [2022-07-21 17:07:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:07:05,787 INFO L225 Difference]: With dead ends: 46 [2022-07-21 17:07:05,787 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 17:07:05,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=76, Invalid=248, Unknown=6, NotChecked=222, Total=552 [2022-07-21 17:07:05,788 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:07:05,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 121 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-21 17:07:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 17:07:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 17:07:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:07:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 17:07:05,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-07-21 17:07:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:07:05,790 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 17:07:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 17:07:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 17:07:05,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 17:07:05,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2022-07-21 17:07:05,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-07-21 17:07:05,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-07-21 17:07:05,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-07-21 17:07:05,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (12 of 17 remaining) [2022-07-21 17:07:05,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (11 of 17 remaining) [2022-07-21 17:07:05,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (10 of 17 remaining) [2022-07-21 17:07:05,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (9 of 17 remaining) [2022-07-21 17:07:05,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-07-21 17:07:05,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-07-21 17:07:05,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-07-21 17:07:05,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2022-07-21 17:07:05,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2022-07-21 17:07:05,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2022-07-21 17:07:05,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2022-07-21 17:07:05,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2022-07-21 17:07:05,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-07-21 17:07:05,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 17:07:06,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-21 17:07:06,006 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:07:06,008 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:07:06,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:07:06 BoogieIcfgContainer [2022-07-21 17:07:06,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:07:06,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:07:06,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:07:06,011 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:07:06,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:04:11" (3/4) ... [2022-07-21 17:07:06,014 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 17:07:06,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 17:07:06,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2022-07-21 17:07:06,019 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 17:07:06,023 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-07-21 17:07:06,023 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-21 17:07:06,023 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-21 17:07:06,024 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 17:07:06,063 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:07:06,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:07:06,064 INFO L158 Benchmark]: Toolchain (without parser) took 174903.58ms. Allocated memory was 48.2MB in the beginning and 107.0MB in the end (delta: 58.7MB). Free memory was 25.3MB in the beginning and 38.2MB in the end (delta: -12.9MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-07-21 17:07:06,064 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 48.2MB. Free memory is still 29.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:07:06,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.85ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 25.1MB in the beginning and 43.5MB in the end (delta: -18.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-21 17:07:06,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 41.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:07:06,065 INFO L158 Benchmark]: Boogie Preprocessor took 37.80ms. Allocated memory is still 60.8MB. Free memory was 41.9MB in the beginning and 40.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:07:06,065 INFO L158 Benchmark]: RCFGBuilder took 394.28ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 42.4MB in the end (delta: -1.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-07-21 17:07:06,065 INFO L158 Benchmark]: TraceAbstraction took 174148.72ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 41.9MB in the beginning and 41.3MB in the end (delta: 528.3kB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2022-07-21 17:07:06,066 INFO L158 Benchmark]: Witness Printer took 52.86ms. Allocated memory is still 107.0MB. Free memory was 41.3MB in the beginning and 38.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:07:06,067 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 48.2MB. Free memory is still 29.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.85ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 25.1MB in the beginning and 43.5MB in the end (delta: -18.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 41.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.80ms. Allocated memory is still 60.8MB. Free memory was 41.9MB in the beginning and 40.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.28ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 42.4MB in the end (delta: -1.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 174148.72ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 41.9MB in the beginning and 41.3MB in the end (delta: 528.3kB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * Witness Printer took 52.86ms. Allocated memory is still 107.0MB. Free memory was 41.3MB in the beginning and 38.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 174.1s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 61.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2270 mSDsluCounter, 7482 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1278 IncrementalHoareTripleChecker+Unchecked, 6305 mSDsCounter, 931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6866 IncrementalHoareTripleChecker+Invalid, 9075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 931 mSolverCounterUnsat, 1177 mSDtfsCounter, 6866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 968 SyntacticMatches, 39 SemanticMatches, 486 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 158.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=18, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 737 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 108.6s InterpolantComputationTime, 1576 NumberOfCodeBlocks, 1576 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1712 ConstructedInterpolants, 105 QuantifiedInterpolants, 10108 SizeOfPredicates, 110 NumberOfNonLiveVariables, 2699 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 804/977 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-21 17:07:06,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE