./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:16:41,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:16:41,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:16:41,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:16:41,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:16:41,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:16:41,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:16:41,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:16:41,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:16:41,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:16:41,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:16:41,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:16:41,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:16:41,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:16:41,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:16:41,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:16:41,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:16:41,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:16:41,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:16:41,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:16:41,471 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:16:41,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:16:41,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:16:41,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:16:41,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:16:41,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:16:41,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:16:41,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:16:41,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:16:41,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:16:41,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:16:41,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:16:41,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:16:41,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:16:41,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:16:41,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:16:41,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:16:41,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:16:41,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:16:41,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:16:41,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:16:41,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:16:41,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:16:41,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:16:41,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:16:41,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:16:41,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:16:41,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:16:41,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:16:41,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:16:41,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:16:41,514 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:16:41,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:16:41,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:16:41,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:16:41,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:16:41,517 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:16:41,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:16:41,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:16:41,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:16:41,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:16:41,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:16:41,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:16:41,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:16:41,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:16:41,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:16:41,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:16:41,518 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-23 06:16:41,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:16:41,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:16:41,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:16:41,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:16:41,744 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:16:41,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-23 06:16:41,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef4cb1c9/19664125dc644b1c8f4bdb145dd6666d/FLAGba53c5272 [2022-07-23 06:16:42,190 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:16:42,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-23 06:16:42,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef4cb1c9/19664125dc644b1c8f4bdb145dd6666d/FLAGba53c5272 [2022-07-23 06:16:42,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef4cb1c9/19664125dc644b1c8f4bdb145dd6666d [2022-07-23 06:16:42,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:16:42,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:16:42,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:16:42,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:16:42,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:16:42,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:42,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51adb469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42, skipping insertion in model container [2022-07-23 06:16:42,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:42,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:16:42,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:16:42,754 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/heap-manipulation/dancing.i[938,951] [2022-07-23 06:16:42,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:16:42,891 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:16:42,904 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/heap-manipulation/dancing.i[938,951] [2022-07-23 06:16:42,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:16:42,954 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:16:42,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42 WrapperNode [2022-07-23 06:16:42,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:16:42,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:16:42,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:16:42,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:16:42,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:42,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,008 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-23 06:16:43,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:16:43,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:16:43,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:16:43,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:16:43,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:16:43,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:16:43,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:16:43,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:16:43,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (1/1) ... [2022-07-23 06:16:43,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:16:43,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:43,065 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-23 06:16:43,066 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-23 06:16:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-23 06:16:43,094 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-23 06:16:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 06:16:43,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 06:16:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:16:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:16:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:16:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:16:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:16:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:16:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:16:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:16:43,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:16:43,243 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:16:43,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:16:43,542 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:16:43,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:16:43,547 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 06:16:43,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:16:43 BoogieIcfgContainer [2022-07-23 06:16:43,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:16:43,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:16:43,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:16:43,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:16:43,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:16:42" (1/3) ... [2022-07-23 06:16:43,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5de36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:16:43, skipping insertion in model container [2022-07-23 06:16:43,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:42" (2/3) ... [2022-07-23 06:16:43,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5de36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:16:43, skipping insertion in model container [2022-07-23 06:16:43,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:16:43" (3/3) ... [2022-07-23 06:16:43,557 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-23 06:16:43,568 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:16:43,569 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-23 06:16:43,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:16:43,623 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@68306fa4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@605701c [2022-07-23 06:16:43,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-23 06:16:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:16:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:16:43,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:43,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:16:43,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:16:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:43,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507676845] [2022-07-23 06:16:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:43,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507676845] [2022-07-23 06:16:43,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507676845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:43,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:43,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:16:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052834396] [2022-07-23 06:16:43,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:43,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:43,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:43,818 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:43,938 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-23 06:16:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:16:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:43,947 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:16:43,947 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:16:43,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:43,951 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:43,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:16:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-23 06:16:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:16:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-23 06:16:44,015 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-07-23 06:16:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,033 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-23 06:16:44,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-23 06:16:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:16:44,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:16:44,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:16:44,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:16:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:44,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686458118] [2022-07-23 06:16:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:44,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686458118] [2022-07-23 06:16:44,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686458118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:44,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:44,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:16:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274820359] [2022-07-23 06:16:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:44,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:44,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:44,093 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:44,176 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-23 06:16:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:16:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:44,180 INFO L225 Difference]: With dead ends: 102 [2022-07-23 06:16:44,180 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 06:16:44,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:44,185 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:44,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 06:16:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-23 06:16:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:16:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-23 06:16:44,194 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-07-23 06:16:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,194 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-23 06:16:44,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-23 06:16:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 06:16:44,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:44,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:16:44,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-07-23 06:16:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524654555] [2022-07-23 06:16:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:44,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:44,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524654555] [2022-07-23 06:16:44,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524654555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:44,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:44,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:16:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329734127] [2022-07-23 06:16:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:44,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:44,291 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:44,375 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-07-23 06:16:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 06:16:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:44,376 INFO L225 Difference]: With dead ends: 165 [2022-07-23 06:16:44,376 INFO L226 Difference]: Without dead ends: 165 [2022-07-23 06:16:44,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:44,377 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:44,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-23 06:16:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-07-23 06:16:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:16:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-23 06:16:44,384 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-07-23 06:16:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,385 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-23 06:16:44,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-23 06:16:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 06:16:44,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:16:44,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-07-23 06:16:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:44,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387747221] [2022-07-23 06:16:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:44,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387747221] [2022-07-23 06:16:44,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387747221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:44,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:44,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:16:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667804951] [2022-07-23 06:16:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:44,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:44,459 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:44,542 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-07-23 06:16:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 06:16:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:44,544 INFO L225 Difference]: With dead ends: 165 [2022-07-23 06:16:44,545 INFO L226 Difference]: Without dead ends: 165 [2022-07-23 06:16:44,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:44,546 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:44,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-23 06:16:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-07-23 06:16:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:16:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-23 06:16:44,552 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-07-23 06:16:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,552 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-23 06:16:44,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-23 06:16:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:16:44,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:44,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:16:44,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-07-23 06:16:44,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034221825] [2022-07-23 06:16:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:44,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034221825] [2022-07-23 06:16:44,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034221825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:44,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:44,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478613701] [2022-07-23 06:16:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:44,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:44,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:44,600 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:44,651 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-07-23 06:16:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:16:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:44,653 INFO L225 Difference]: With dead ends: 176 [2022-07-23 06:16:44,653 INFO L226 Difference]: Without dead ends: 176 [2022-07-23 06:16:44,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:44,654 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:44,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-23 06:16:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2022-07-23 06:16:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:16:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-07-23 06:16:44,661 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-07-23 06:16:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,662 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-07-23 06:16:44,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-07-23 06:16:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:16:44,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:44,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:16:44,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-07-23 06:16:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:44,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221382505] [2022-07-23 06:16:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:44,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221382505] [2022-07-23 06:16:44,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221382505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:44,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:44,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873143399] [2022-07-23 06:16:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:44,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:44,737 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:44,827 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-07-23 06:16:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:16:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:16:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:44,829 INFO L225 Difference]: With dead ends: 140 [2022-07-23 06:16:44,829 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 06:16:44,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:16:44,830 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 218 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:44,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 105 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 06:16:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-23 06:16:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:16:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-07-23 06:16:44,835 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-07-23 06:16:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:44,835 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-07-23 06:16:44,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-07-23 06:16:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:16:44,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:44,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:44,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:16:44,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-07-23 06:16:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352202211] [2022-07-23 06:16:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:44,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352202211] [2022-07-23 06:16:44,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352202211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:44,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:44,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:44,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083007835] [2022-07-23 06:16:44,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:44,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:44,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:44,893 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:45,055 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2022-07-23 06:16:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:45,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-23 06:16:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:45,056 INFO L225 Difference]: With dead ends: 159 [2022-07-23 06:16:45,056 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 06:16:45,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:45,057 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 238 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:45,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 203 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 06:16:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2022-07-23 06:16:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 122 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:16:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-23 06:16:45,062 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 15 [2022-07-23 06:16:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:45,062 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-23 06:16:45,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-23 06:16:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:16:45,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:45,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:45,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:16:45,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-07-23 06:16:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900044958] [2022-07-23 06:16:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:45,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900044958] [2022-07-23 06:16:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900044958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:45,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134400929] [2022-07-23 06:16:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:45,137 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:45,283 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2022-07-23 06:16:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:45,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-23 06:16:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:45,284 INFO L225 Difference]: With dead ends: 155 [2022-07-23 06:16:45,284 INFO L226 Difference]: Without dead ends: 155 [2022-07-23 06:16:45,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:16:45,285 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:45,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 186 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-23 06:16:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2022-07-23 06:16:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:16:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2022-07-23 06:16:45,289 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 15 [2022-07-23 06:16:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:45,289 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2022-07-23 06:16:45,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2022-07-23 06:16:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:16:45,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:45,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:16:45,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-07-23 06:16:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108685858] [2022-07-23 06:16:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108685858] [2022-07-23 06:16:45,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108685858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316951018] [2022-07-23 06:16:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:45,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:45,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:45,348 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-23 06:16:45,349 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-23 06:16:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:45,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:16:45,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:45,492 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-23 06:16:45,527 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:16:45,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:16:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:45,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:45,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316951018] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:16:45,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:16:45,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-07-23 06:16:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023883132] [2022-07-23 06:16:45,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:45,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 06:16:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 06:16:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:16:45,855 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:46,225 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-07-23 06:16:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:16:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:16:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:46,227 INFO L225 Difference]: With dead ends: 200 [2022-07-23 06:16:46,227 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 06:16:46,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:16:46,228 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 362 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:46,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 447 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:16:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 06:16:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2022-07-23 06:16:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.65) internal successors, (165), 128 states have internal predecessors, (165), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 06:16:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-07-23 06:16:46,233 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 16 [2022-07-23 06:16:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:46,234 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-07-23 06:16:46,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-07-23 06:16:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:16:46,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:46,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:46,260 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-23 06:16:46,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:46,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:46,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-07-23 06:16:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:46,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45474507] [2022-07-23 06:16:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:46,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:46,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45474507] [2022-07-23 06:16:46,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45474507] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:46,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83836398] [2022-07-23 06:16:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:46,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:46,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:46,519 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-23 06:16:46,547 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-23 06:16:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:46,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:16:46,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:46,615 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:16:46,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:16:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:46,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:46,902 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 18 treesize of output 14 [2022-07-23 06:16:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:46,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83836398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:16:46,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:16:46,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-23 06:16:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154054308] [2022-07-23 06:16:46,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:46,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:16:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:16:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:16:46,912 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:47,348 INFO L93 Difference]: Finished difference Result 197 states and 251 transitions. [2022-07-23 06:16:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:16:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:16:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:47,349 INFO L225 Difference]: With dead ends: 197 [2022-07-23 06:16:47,349 INFO L226 Difference]: Without dead ends: 197 [2022-07-23 06:16:47,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-23 06:16:47,350 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 495 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:47,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 497 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:16:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-23 06:16:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 142. [2022-07-23 06:16:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.62) internal successors, (162), 127 states have internal predecessors, (162), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 06:16:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2022-07-23 06:16:47,354 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 16 [2022-07-23 06:16:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:47,355 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-07-23 06:16:47,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2022-07-23 06:16:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 06:16:47,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:47,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:47,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:16:47,565 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,SelfDestructingSolverStorable9 [2022-07-23 06:16:47,565 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-07-23 06:16:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:47,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033610138] [2022-07-23 06:16:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:47,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033610138] [2022-07-23 06:16:47,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033610138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:47,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:47,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:16:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359077065] [2022-07-23 06:16:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:16:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:47,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:16:47,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:47,679 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:47,837 INFO L93 Difference]: Finished difference Result 190 states and 242 transitions. [2022-07-23 06:16:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:16:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-23 06:16:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:47,838 INFO L225 Difference]: With dead ends: 190 [2022-07-23 06:16:47,839 INFO L226 Difference]: Without dead ends: 190 [2022-07-23 06:16:47,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:16:47,839 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 187 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:47,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 395 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-23 06:16:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2022-07-23 06:16:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 134 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-23 06:16:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2022-07-23 06:16:47,844 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 19 [2022-07-23 06:16:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:47,844 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2022-07-23 06:16:47,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2022-07-23 06:16:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:16:47,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:47,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:47,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:16:47,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-07-23 06:16:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:47,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786246240] [2022-07-23 06:16:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:47,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786246240] [2022-07-23 06:16:47,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786246240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:47,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:47,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:16:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442378032] [2022-07-23 06:16:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:47,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:16:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:16:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:16:47,946 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:48,053 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2022-07-23 06:16:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:16:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-23 06:16:48,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:48,056 INFO L225 Difference]: With dead ends: 185 [2022-07-23 06:16:48,056 INFO L226 Difference]: Without dead ends: 185 [2022-07-23 06:16:48,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:16:48,057 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 135 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:48,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-23 06:16:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2022-07-23 06:16:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 136 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-23 06:16:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2022-07-23 06:16:48,064 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 21 [2022-07-23 06:16:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:48,064 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2022-07-23 06:16:48,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2022-07-23 06:16:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:16:48,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:48,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:48,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:16:48,066 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:48,067 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-07-23 06:16:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:48,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384727333] [2022-07-23 06:16:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:48,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384727333] [2022-07-23 06:16:48,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384727333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:48,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616361898] [2022-07-23 06:16:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:48,196 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-23 06:16:48,198 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-23 06:16:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-23 06:16:48,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:48,294 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-23 06:16:48,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:16:48,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:16:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:48,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:48,495 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 42 treesize of output 36 [2022-07-23 06:16:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:48,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616361898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:16:48,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:16:48,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2022-07-23 06:16:48,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548600037] [2022-07-23 06:16:48,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:48,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:16:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:48,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:16:48,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:16:48,589 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:49,940 INFO L93 Difference]: Finished difference Result 500 states and 656 transitions. [2022-07-23 06:16:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:16:49,941 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 06:16:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:49,944 INFO L225 Difference]: With dead ends: 500 [2022-07-23 06:16:49,944 INFO L226 Difference]: Without dead ends: 500 [2022-07-23 06:16:49,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 06:16:49,945 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1024 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:49,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1635 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1932 Invalid, 0 Unknown, 100 Unchecked, 1.0s Time] [2022-07-23 06:16:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-23 06:16:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 237. [2022-07-23 06:16:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5795454545454546) internal successors, (278), 206 states have internal predecessors, (278), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 06:16:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2022-07-23 06:16:49,955 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 22 [2022-07-23 06:16:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:49,965 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2022-07-23 06:16:49,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2022-07-23 06:16:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:16:49,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:49,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:49,989 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-23 06:16:50,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:50,182 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-07-23 06:16:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:50,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200348615] [2022-07-23 06:16:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:16:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200348615] [2022-07-23 06:16:50,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200348615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304762631] [2022-07-23 06:16:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:50,228 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-23 06:16:50,243 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-23 06:16:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:16:50,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:50,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:50,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304762631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:16:50,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:16:50,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-23 06:16:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534806875] [2022-07-23 06:16:50,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:50,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:16:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:16:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:16:50,447 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:16:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:50,819 INFO L93 Difference]: Finished difference Result 305 states and 388 transitions. [2022-07-23 06:16:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:16:50,819 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2022-07-23 06:16:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:50,820 INFO L225 Difference]: With dead ends: 305 [2022-07-23 06:16:50,820 INFO L226 Difference]: Without dead ends: 299 [2022-07-23 06:16:50,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-23 06:16:50,821 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:50,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 630 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:16:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-23 06:16:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 237. [2022-07-23 06:16:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5625) internal successors, (275), 206 states have internal predecessors, (275), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 06:16:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2022-07-23 06:16:50,827 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 21 [2022-07-23 06:16:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:50,828 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2022-07-23 06:16:50,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:16:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-07-23 06:16:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:16:50,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:50,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:50,846 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-23 06:16:51,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:51,029 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-07-23 06:16:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:51,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745881421] [2022-07-23 06:16:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745881421] [2022-07-23 06:16:51,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745881421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:51,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:51,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416584420] [2022-07-23 06:16:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:51,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:51,065 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:51,084 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2022-07-23 06:16:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-23 06:16:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:51,088 INFO L225 Difference]: With dead ends: 251 [2022-07-23 06:16:51,088 INFO L226 Difference]: Without dead ends: 251 [2022-07-23 06:16:51,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:51,091 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:51,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-23 06:16:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2022-07-23 06:16:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 179 states have (on average 1.553072625698324) internal successors, (278), 214 states have internal predecessors, (278), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-23 06:16:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 338 transitions. [2022-07-23 06:16:51,099 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 338 transitions. Word has length 24 [2022-07-23 06:16:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:51,099 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 338 transitions. [2022-07-23 06:16:51,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 338 transitions. [2022-07-23 06:16:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:16:51,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:51,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:51,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:16:51,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-07-23 06:16:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:51,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599275940] [2022-07-23 06:16:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:16:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599275940] [2022-07-23 06:16:51,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599275940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:51,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:51,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087331947] [2022-07-23 06:16:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:51,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:51,154 INFO L87 Difference]: Start difference. First operand 246 states and 338 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:51,311 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2022-07-23 06:16:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:16:51,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-23 06:16:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:51,313 INFO L225 Difference]: With dead ends: 304 [2022-07-23 06:16:51,313 INFO L226 Difference]: Without dead ends: 304 [2022-07-23 06:16:51,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:51,314 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 206 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:51,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 254 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-23 06:16:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2022-07-23 06:16:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 179 states have (on average 1.541899441340782) internal successors, (276), 213 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-23 06:16:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2022-07-23 06:16:51,323 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 23 [2022-07-23 06:16:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:51,324 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2022-07-23 06:16:51,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2022-07-23 06:16:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:16:51,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:51,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:51,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:16:51,327 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275187, now seen corresponding path program 1 times [2022-07-23 06:16:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:51,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556012468] [2022-07-23 06:16:51,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:16:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556012468] [2022-07-23 06:16:51,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556012468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:51,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:51,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398432273] [2022-07-23 06:16:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:51,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:51,394 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:51,553 INFO L93 Difference]: Finished difference Result 302 states and 382 transitions. [2022-07-23 06:16:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:16:51,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-23 06:16:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:51,554 INFO L225 Difference]: With dead ends: 302 [2022-07-23 06:16:51,555 INFO L226 Difference]: Without dead ends: 302 [2022-07-23 06:16:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-23 06:16:51,555 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:51,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 349 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-23 06:16:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 239. [2022-07-23 06:16:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 207 states have internal predecessors, (267), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-23 06:16:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 327 transitions. [2022-07-23 06:16:51,561 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 327 transitions. Word has length 23 [2022-07-23 06:16:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:51,561 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 327 transitions. [2022-07-23 06:16:51,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 327 transitions. [2022-07-23 06:16:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:16:51,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:51,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:51,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 06:16:51,562 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-07-23 06:16:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:51,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114567552] [2022-07-23 06:16:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:16:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114567552] [2022-07-23 06:16:51,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114567552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:51,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947367713] [2022-07-23 06:16:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:51,923 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-23 06:16:51,924 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-23 06:16:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:16:52,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:52,032 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-23 06:16:52,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:16:52,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:16:52,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-23 06:16:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:52,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:52,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947367713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:52,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:16:52,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2022-07-23 06:16:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853973405] [2022-07-23 06:16:52,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:52,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 06:16:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 06:16:52,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:16:52,356 INFO L87 Difference]: Start difference. First operand 239 states and 327 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:16:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:53,986 INFO L93 Difference]: Finished difference Result 552 states and 721 transitions. [2022-07-23 06:16:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 06:16:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-23 06:16:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:53,989 INFO L225 Difference]: With dead ends: 552 [2022-07-23 06:16:53,989 INFO L226 Difference]: Without dead ends: 552 [2022-07-23 06:16:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2022-07-23 06:16:53,990 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 594 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:53,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1968 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1669 Invalid, 0 Unknown, 654 Unchecked, 0.9s Time] [2022-07-23 06:16:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-07-23 06:16:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 252. [2022-07-23 06:16:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 218 states have internal predecessors, (280), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-23 06:16:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-07-23 06:16:53,997 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 25 [2022-07-23 06:16:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:53,997 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-07-23 06:16:53,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:16:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-07-23 06:16:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:16:53,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:53,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:54,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-23 06:16:54,218 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,SelfDestructingSolverStorable17 [2022-07-23 06:16:54,219 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-07-23 06:16:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:54,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034741114] [2022-07-23 06:16:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:54,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:16:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034741114] [2022-07-23 06:16:54,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034741114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708005064] [2022-07-23 06:16:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:54,561 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-23 06:16:54,562 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-23 06:16:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:54,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-23 06:16:54,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:54,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:16:54,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:16:54,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:16:54,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:16:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:54,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:54,957 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 78 treesize of output 72 [2022-07-23 06:16:54,959 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 118 treesize of output 106 [2022-07-23 06:16:54,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:54,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:55,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-23 06:16:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:55,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708005064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:16:55,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:16:55,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 26 [2022-07-23 06:16:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614616858] [2022-07-23 06:16:55,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:16:55,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 06:16:55,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:55,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 06:16:55,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-23 06:16:55,056 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:16:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:56,477 INFO L93 Difference]: Finished difference Result 410 states and 506 transitions. [2022-07-23 06:16:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:16:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-07-23 06:16:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:56,479 INFO L225 Difference]: With dead ends: 410 [2022-07-23 06:16:56,479 INFO L226 Difference]: Without dead ends: 410 [2022-07-23 06:16:56,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 06:16:56,480 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 582 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:56,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1297 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1483 Invalid, 0 Unknown, 80 Unchecked, 0.8s Time] [2022-07-23 06:16:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-23 06:16:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 261. [2022-07-23 06:16:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 225 states have internal predecessors, (284), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-23 06:16:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-07-23 06:16:56,491 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 25 [2022-07-23 06:16:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:56,492 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-07-23 06:16:56,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:16:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-07-23 06:16:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:16:56,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:56,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:56,529 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-23 06:16:56,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:56,708 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-07-23 06:16:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:56,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661681799] [2022-07-23 06:16:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 06:16:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:56,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661681799] [2022-07-23 06:16:56,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661681799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:56,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:56,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519991883] [2022-07-23 06:16:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:56,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:56,748 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:16:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:56,865 INFO L93 Difference]: Finished difference Result 271 states and 340 transitions. [2022-07-23 06:16:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-23 06:16:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:56,867 INFO L225 Difference]: With dead ends: 271 [2022-07-23 06:16:56,867 INFO L226 Difference]: Without dead ends: 271 [2022-07-23 06:16:56,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:56,868 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 159 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:56,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 195 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-23 06:16:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 258. [2022-07-23 06:16:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 222 states have internal predecessors, (273), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-23 06:16:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2022-07-23 06:16:56,881 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 27 [2022-07-23 06:16:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:56,881 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2022-07-23 06:16:56,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:16:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2022-07-23 06:16:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:16:56,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:56,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 06:16:56,883 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-07-23 06:16:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102940086] [2022-07-23 06:16:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:16:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 06:16:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:56,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102940086] [2022-07-23 06:16:56,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102940086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:56,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:56,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450531674] [2022-07-23 06:16:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:56,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:56,947 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:16:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:57,071 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2022-07-23 06:16:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-23 06:16:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:57,072 INFO L225 Difference]: With dead ends: 269 [2022-07-23 06:16:57,072 INFO L226 Difference]: Without dead ends: 269 [2022-07-23 06:16:57,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:16:57,073 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 214 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:57,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 167 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-23 06:16:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-07-23 06:16:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 222 states have internal predecessors, (267), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-23 06:16:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2022-07-23 06:16:57,080 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 27 [2022-07-23 06:16:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:57,081 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2022-07-23 06:16:57,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:16:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2022-07-23 06:16:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:16:57,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:57,082 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:57,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 06:16:57,083 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash 468828335, now seen corresponding path program 1 times [2022-07-23 06:16:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:57,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412947752] [2022-07-23 06:16:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:16:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:16:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:57,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412947752] [2022-07-23 06:16:57,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412947752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:57,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:57,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:16:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744524636] [2022-07-23 06:16:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:57,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:57,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:57,119 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:57,126 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2022-07-23 06:16:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-23 06:16:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:57,128 INFO L225 Difference]: With dead ends: 267 [2022-07-23 06:16:57,128 INFO L226 Difference]: Without dead ends: 267 [2022-07-23 06:16:57,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:57,130 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:57,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-23 06:16:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2022-07-23 06:16:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 205 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-23 06:16:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-07-23 06:16:57,137 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 26 [2022-07-23 06:16:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:57,137 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-07-23 06:16:57,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-07-23 06:16:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:16:57,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:57,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:57,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 06:16:57,138 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1109218320, now seen corresponding path program 1 times [2022-07-23 06:16:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:57,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211231811] [2022-07-23 06:16:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:16:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:16:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:57,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211231811] [2022-07-23 06:16:57,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211231811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:57,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:57,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615196913] [2022-07-23 06:16:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:57,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:57,187 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:57,202 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2022-07-23 06:16:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:16:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-23 06:16:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:57,204 INFO L225 Difference]: With dead ends: 252 [2022-07-23 06:16:57,204 INFO L226 Difference]: Without dead ends: 248 [2022-07-23 06:16:57,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:57,204 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:57,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-23 06:16:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2022-07-23 06:16:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 209 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (34), 21 states have call predecessors, (34), 30 states have call successors, (34) [2022-07-23 06:16:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2022-07-23 06:16:57,214 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 27 [2022-07-23 06:16:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:57,214 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2022-07-23 06:16:57,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:16:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2022-07-23 06:16:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:16:57,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:57,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:57,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 06:16:57,215 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:16:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-07-23 06:16:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307815550] [2022-07-23 06:16:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307815550] [2022-07-23 06:16:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307815550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189931115] [2022-07-23 06:16:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:57,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:57,582 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-23 06:16:57,583 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-23 06:16:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:57,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-23 06:16:57,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:57,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:16:57,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:16:57,820 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:16:57,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:16:57,827 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 7 treesize of output 3 [2022-07-23 06:16:57,838 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:16:57,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:16:57,846 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 7 treesize of output 3 [2022-07-23 06:16:57,890 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:16:57,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 06:16:57,905 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:16:57,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 06:16:57,943 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:16:57,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-23 06:16:57,961 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:16:57,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-23 06:16:58,066 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:16:58,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:16:58,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:16:58,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-23 06:16:58,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-23 06:16:58,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-23 06:16:58,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-23 06:16:58,283 INFO L356 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2022-07-23 06:16:58,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-07-23 06:16:58,295 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:16:58,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-23 06:16:58,794 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 33 treesize of output 17 [2022-07-23 06:16:58,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:16:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:16:58,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:16:59,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:16:59,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 347 [2022-07-23 06:17:07,072 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 96 DAG size of output: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:17:10,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:10,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 308 treesize of output 378 [2022-07-23 06:17:20,727 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse13 (store (let ((.cse15 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse12 v_prenex_27) (= .cse12 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse16 v_prenex_27) (= .cse16 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse29 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse30 (store (let ((.cse31 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-23 06:17:20,988 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse13 (store (let ((.cse15 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse12 v_prenex_27) (= .cse12 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse16 v_prenex_27) (= .cse16 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse29 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse30 (store (let ((.cse31 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse29) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-23 06:17:21,079 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 0) .cse4) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse4) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse6 (select (let ((.cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_prenex_27)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse6) (= .cse6 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse11 (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse12 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13 v_prenex_27)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse11) (= .cse11 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (let ((.cse15 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse20 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 0) .cse20) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse19 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse20) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-23 06:17:21,111 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:17:21,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-23 06:17:21,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:21,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2022-07-23 06:17:21,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:21,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-23 06:17:21,135 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-23 06:17:21,139 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 40 treesize of output 32 [2022-07-23 06:17:21,147 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:17:21,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2022-07-23 06:17:21,152 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:17:21,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2022-07-23 06:17:21,158 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:17:21,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-23 06:17:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:17:21,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189931115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:17:21,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:17:21,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 49 [2022-07-23 06:17:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523138266] [2022-07-23 06:17:21,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:21,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 06:17:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:21,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 06:17:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1998, Unknown=7, NotChecked=276, Total=2450 [2022-07-23 06:17:21,162 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:23,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse11 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (and (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 0) .cse4) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse4) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse6 (select (let ((.cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_prenex_27)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse6) (= .cse6 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse10 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|)))) .cse11) (<= .cse12 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13)) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse14 (select (let ((.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse15 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse16 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse16 v_prenex_27)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= v_prenex_27 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_prenex_27 .cse14) (= .cse14 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (<= 8 .cse12) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse13) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (let ((.cse18 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_prenex_26))) v_prenex_24 v_prenex_25) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= v_prenex_24 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (let ((.cse20 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20 v_prenex_29))) v_prenex_28 v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= v_prenex_28 |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse11 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse23 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 0) .cse23) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse23) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-07-23 06:17:25,208 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (<= 8 .cse0) (or .cse2 (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse13 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse16 (store (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse15 v_prenex_27) (= .cse15 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse19 v_prenex_27) (= .cse19 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse24 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse23 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse24 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse2 (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse30 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse32 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse29 (store (let ((.cse31 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse32) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse33 (store (let ((.cse34 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse32) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-07-23 06:17:27,221 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse20 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse18 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_main_~n~0#1.offset| 0))) (and (or .cse0 (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse1 (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse5 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse7 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse8 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse8 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse10 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse13 (select (select (let ((.cse15 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse14 (store (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse15 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse15 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse13 v_prenex_27) (= .cse13 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))))) (or (and .cse0 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (let ((.cse17 (select |c_#length| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (<= 8 .cse17) .cse18 .cse19 (<= .cse17 8)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20)) (= (+ |c_ULTIMATE.start_main_~#list~0#1.offset| (* |c_ULTIMATE.start_main_~tail~0#1.offset| (- 1))) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20) 0) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_prenex_27 Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (let ((.cse21 (select (select (let ((.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse22 (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_27 v_prenex_2))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_prenex_27)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse21 v_prenex_27) (= .cse21 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_27)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse18 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_26 Int) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse25 (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_prenex_26))) v_prenex_24 v_prenex_25))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_24))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) .cse19 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= 0 (+ (select (select (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse28 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 v_prenex_29))) v_prenex_28 v_prenex_3))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_28))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse32 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse34 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse31 (store (let ((.cse33 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse34) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse35 (store (let ((.cse36 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse36 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse32 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse34) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-07-23 06:17:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:33,370 INFO L93 Difference]: Finished difference Result 743 states and 942 transitions. [2022-07-23 06:17:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-23 06:17:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 06:17:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:33,374 INFO L225 Difference]: With dead ends: 743 [2022-07-23 06:17:33,374 INFO L226 Difference]: Without dead ends: 743 [2022-07-23 06:17:33,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=623, Invalid=6873, Unknown=10, NotChecked=1050, Total=8556 [2022-07-23 06:17:33,376 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1460 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 5883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2637 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:33,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2521 Invalid, 5883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2930 Invalid, 0 Unknown, 2637 Unchecked, 2.1s Time] [2022-07-23 06:17:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-07-23 06:17:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 327. [2022-07-23 06:17:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 283 states have internal predecessors, (340), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (46), 28 states have call predecessors, (46), 40 states have call successors, (46) [2022-07-23 06:17:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 426 transitions. [2022-07-23 06:17:33,385 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 426 transitions. Word has length 28 [2022-07-23 06:17:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:33,385 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 426 transitions. [2022-07-23 06:17:33,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-07-23 06:17:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:17:33,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:33,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:33,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-23 06:17:33,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:33,600 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-07-23 06:17:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:33,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831755929] [2022-07-23 06:17:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:17:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831755929] [2022-07-23 06:17:33,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831755929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83668788] [2022-07-23 06:17:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:33,791 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-23 06:17:33,792 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-23 06:17:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:33,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 06:17:33,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:33,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:17:34,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:34,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-23 06:17:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:34,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:34,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83668788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:34,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:17:34,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-07-23 06:17:34,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594997557] [2022-07-23 06:17:34,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:34,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:17:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:17:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:17:34,187 INFO L87 Difference]: Start difference. First operand 327 states and 426 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:34,644 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2022-07-23 06:17:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:17:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-23 06:17:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:34,645 INFO L225 Difference]: With dead ends: 348 [2022-07-23 06:17:34,646 INFO L226 Difference]: Without dead ends: 347 [2022-07-23 06:17:34,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 06:17:34,646 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 150 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:34,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 892 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 348 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-07-23 06:17:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-23 06:17:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 308. [2022-07-23 06:17:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.3487394957983194) internal successors, (321), 267 states have internal predecessors, (321), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 26 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-23 06:17:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 399 transitions. [2022-07-23 06:17:34,653 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 399 transitions. Word has length 27 [2022-07-23 06:17:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:34,653 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 399 transitions. [2022-07-23 06:17:34,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2022-07-23 06:17:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:17:34,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:34,654 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] [2022-07-23 06:17:34,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-23 06:17:34,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 06:17:34,868 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1952238210, now seen corresponding path program 1 times [2022-07-23 06:17:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:34,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230316569] [2022-07-23 06:17:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:17:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 06:17:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:34,893 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-23 06:17:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:34,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230316569] [2022-07-23 06:17:34,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230316569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:34,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:34,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:17:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706230118] [2022-07-23 06:17:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:34,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:17:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:34,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:17:34,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:17:34,895 INFO L87 Difference]: Start difference. First operand 308 states and 399 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:34,918 INFO L93 Difference]: Finished difference Result 317 states and 400 transitions. [2022-07-23 06:17:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:17:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-23 06:17:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:34,920 INFO L225 Difference]: With dead ends: 317 [2022-07-23 06:17:34,920 INFO L226 Difference]: Without dead ends: 317 [2022-07-23 06:17:34,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-23 06:17:34,920 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:34,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:17:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-23 06:17:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2022-07-23 06:17:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 265 states have internal predecessors, (319), 34 states have call successors, (34), 14 states have call predecessors, (34), 17 states have return successors, (40), 25 states have call predecessors, (40), 34 states have call successors, (40) [2022-07-23 06:17:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 393 transitions. [2022-07-23 06:17:34,932 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 393 transitions. Word has length 30 [2022-07-23 06:17:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:34,932 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 393 transitions. [2022-07-23 06:17:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 393 transitions. [2022-07-23 06:17:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:17:34,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:34,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:34,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 06:17:34,934 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:34,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-07-23 06:17:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:34,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007513011] [2022-07-23 06:17:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:17:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 06:17:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007513011] [2022-07-23 06:17:35,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007513011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:35,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:35,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:17:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705043374] [2022-07-23 06:17:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:35,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:17:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:17:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:17:35,052 INFO L87 Difference]: Start difference. First operand 305 states and 393 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:35,189 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-07-23 06:17:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:17:35,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-23 06:17:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:35,190 INFO L225 Difference]: With dead ends: 323 [2022-07-23 06:17:35,190 INFO L226 Difference]: Without dead ends: 323 [2022-07-23 06:17:35,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:17:35,191 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 110 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:35,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 353 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-23 06:17:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 311. [2022-07-23 06:17:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 270 states have internal predecessors, (324), 35 states have call successors, (35), 14 states have call predecessors, (35), 17 states have return successors, (41), 26 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-23 06:17:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 400 transitions. [2022-07-23 06:17:35,197 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 400 transitions. Word has length 30 [2022-07-23 06:17:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:35,197 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 400 transitions. [2022-07-23 06:17:35,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 400 transitions. [2022-07-23 06:17:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:17:35,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:35,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:35,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 06:17:35,199 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-07-23 06:17:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:35,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655463244] [2022-07-23 06:17:35,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 06:17:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 06:17:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:35,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655463244] [2022-07-23 06:17:35,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655463244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:35,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:35,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:17:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843695349] [2022-07-23 06:17:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:35,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:17:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:35,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:17:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:17:35,269 INFO L87 Difference]: Start difference. First operand 311 states and 400 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:35,405 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2022-07-23 06:17:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:17:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-23 06:17:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:35,407 INFO L225 Difference]: With dead ends: 348 [2022-07-23 06:17:35,407 INFO L226 Difference]: Without dead ends: 348 [2022-07-23 06:17:35,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:17:35,407 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:35,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 365 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-23 06:17:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2022-07-23 06:17:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.3307392996108949) internal successors, (342), 286 states have internal predecessors, (342), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (45), 29 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-23 06:17:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2022-07-23 06:17:35,413 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 32 [2022-07-23 06:17:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:35,414 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2022-07-23 06:17:35,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2022-07-23 06:17:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:17:35,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:35,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:35,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 06:17:35,415 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-07-23 06:17:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:35,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619713453] [2022-07-23 06:17:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:17:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619713453] [2022-07-23 06:17:35,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619713453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007965862] [2022-07-23 06:17:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:35,648 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-23 06:17:35,692 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-23 06:17:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:35,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-23 06:17:35,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:35,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:17:35,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:17:35,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:35,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:17:35,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:35,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:17:35,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:35,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:17:35,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:35,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:17:35,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:35,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:17:35,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:35,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:17:35,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:17:35,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:17:36,180 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:36,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-23 06:17:36,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:36,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:17:36,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:17:36,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:36,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 06:17:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:36,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:36,221 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-23 06:17:36,229 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-23 06:17:36,241 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1074) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2022-07-23 06:17:36,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007965862] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:36,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:17:36,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-23 06:17:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302733381] [2022-07-23 06:17:36,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:17:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:17:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=323, Unknown=3, NotChecked=114, Total=506 [2022-07-23 06:17:36,255 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:36,969 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-07-23 06:17:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:17:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-23 06:17:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:36,971 INFO L225 Difference]: With dead ends: 384 [2022-07-23 06:17:36,971 INFO L226 Difference]: Without dead ends: 384 [2022-07-23 06:17:36,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=757, Unknown=3, NotChecked=180, Total=1122 [2022-07-23 06:17:36,972 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 329 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:36,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 878 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 634 Invalid, 0 Unknown, 84 Unchecked, 0.4s Time] [2022-07-23 06:17:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-23 06:17:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 320. [2022-07-23 06:17:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 277 states have internal predecessors, (329), 38 states have call successors, (38), 14 states have call predecessors, (38), 17 states have return successors, (44), 28 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-23 06:17:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 411 transitions. [2022-07-23 06:17:36,979 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 411 transitions. Word has length 31 [2022-07-23 06:17:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:36,979 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 411 transitions. [2022-07-23 06:17:36,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:17:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 411 transitions. [2022-07-23 06:17:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:17:36,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:36,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:37,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-23 06:17:37,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-23 06:17:37,200 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:37,201 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 1 times [2022-07-23 06:17:37,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:37,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682816775] [2022-07-23 06:17:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682816775] [2022-07-23 06:17:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682816775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427491143] [2022-07-23 06:17:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:37,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:37,473 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-23 06:17:37,474 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-23 06:17:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:37,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-23 06:17:37,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:37,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:17:37,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:17:37,683 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:17:37,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:17:37,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:17:37,699 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:17:37,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:17:37,717 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 7 treesize of output 3 [2022-07-23 06:17:37,755 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:17:37,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 06:17:37,768 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:17:37,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 06:17:37,789 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:17:37,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-23 06:17:37,818 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:17:37,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-23 06:17:37,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:17:37,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:17:37,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-23 06:17:38,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-23 06:17:38,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-07-23 06:17:38,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-07-23 06:17:38,111 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:17:38,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2022-07-23 06:17:38,123 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:17:38,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2022-07-23 06:17:39,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:39,320 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:17:39,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 41 [2022-07-23 06:17:39,327 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:17:39,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-23 06:17:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:39,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:39,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:39,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 239 [2022-07-23 06:17:39,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:39,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 199 [2022-07-23 06:17:52,740 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 101 [2022-07-23 06:17:52,740 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-23 06:17:52,741 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-23 06:17:52,760 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-23 06:17:52,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:52,942 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 53 more [2022-07-23 06:17:52,947 INFO L158 Benchmark]: Toolchain (without parser) took 70391.62ms. Allocated memory was 121.6MB in the beginning and 237.0MB in the end (delta: 115.3MB). Free memory was 85.2MB in the beginning and 112.2MB in the end (delta: -27.0MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2022-07-23 06:17:52,947 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:17:52,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.01ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 88.0MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 06:17:52,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 121.6MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:17:52,948 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:17:52,948 INFO L158 Benchmark]: RCFGBuilder took 509.51ms. Allocated memory is still 121.6MB. Free memory was 83.8MB in the beginning and 64.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-23 06:17:52,948 INFO L158 Benchmark]: TraceAbstraction took 69395.98ms. Allocated memory was 121.6MB in the beginning and 237.0MB in the end (delta: 115.3MB). Free memory was 64.2MB in the beginning and 112.2MB in the end (delta: -48.0MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2022-07-23 06:17:52,949 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.15ms. Allocated memory is still 121.6MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.01ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 88.0MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 121.6MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 509.51ms. Allocated memory is still 121.6MB. Free memory was 83.8MB in the beginning and 64.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 69395.98ms. Allocated memory was 121.6MB in the beginning and 237.0MB in the end (delta: 115.3MB). Free memory was 64.2MB in the beginning and 112.2MB in the end (delta: -48.0MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:17:54,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:17:54,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:17:54,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:17:54,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:17:54,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:17:54,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:17:54,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:17:54,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:17:54,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:17:54,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:17:54,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:17:54,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:17:54,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:17:54,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:17:54,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:17:54,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:17:54,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:17:54,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:17:54,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:17:54,643 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:17:54,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:17:54,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:17:54,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:17:54,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:17:54,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:17:54,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:17:54,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:17:54,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:17:54,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:17:54,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:17:54,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:17:54,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:17:54,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:17:54,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:17:54,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:17:54,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:17:54,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:17:54,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:17:54,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:17:54,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:17:54,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:17:54,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:17:54,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:17:54,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:17:54,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:17:54,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:17:54,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:17:54,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:17:54,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:17:54,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:17:54,709 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:17:54,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:17:54,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:17:54,710 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:17:54,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:17:54,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:17:54,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:17:54,710 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:17:54,710 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:17:54,711 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:17:54,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:17:54,711 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:17:54,711 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:17:54,711 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:17:54,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:17:54,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:17:54,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:17:54,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:17:54,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:17:54,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:17:54,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:17:54,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:17:54,713 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:17:54,713 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:17:54,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:17:54,713 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-23 06:17:55,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:17:55,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:17:55,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:17:55,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:17:55,039 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:17:55,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-23 06:17:55,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025332721/fce35ec0d3f748048d056ea5be6ba40e/FLAG8d3592822 [2022-07-23 06:17:55,522 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:17:55,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-23 06:17:55,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025332721/fce35ec0d3f748048d056ea5be6ba40e/FLAG8d3592822 [2022-07-23 06:17:55,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025332721/fce35ec0d3f748048d056ea5be6ba40e [2022-07-23 06:17:55,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:17:55,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:17:55,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:17:55,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:17:55,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:17:55,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:55,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ce5227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55, skipping insertion in model container [2022-07-23 06:17:55,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:55,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:17:55,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:17:55,775 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/heap-manipulation/dancing.i[938,951] [2022-07-23 06:17:55,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:17:55,896 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:17:55,909 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/heap-manipulation/dancing.i[938,951] [2022-07-23 06:17:55,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:17:55,975 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:17:55,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55 WrapperNode [2022-07-23 06:17:55,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:17:55,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:17:55,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:17:55,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:17:55,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,037 INFO L137 Inliner]: procedures = 125, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2022-07-23 06:17:56,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:17:56,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:17:56,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:17:56,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:17:56,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:17:56,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:17:56,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:17:56,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:17:56,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (1/1) ... [2022-07-23 06:17:56,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:17:56,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:56,104 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-23 06:17:56,113 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-23 06:17:56,142 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-23 06:17:56,143 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-23 06:17:56,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 06:17:56,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:17:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:17:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:17:56,225 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:17:56,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:17:56,680 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:17:56,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:17:56,685 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 06:17:56,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:17:56 BoogieIcfgContainer [2022-07-23 06:17:56,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:17:56,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:17:56,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:17:56,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:17:56,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:17:55" (1/3) ... [2022-07-23 06:17:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fee1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:17:56, skipping insertion in model container [2022-07-23 06:17:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:17:55" (2/3) ... [2022-07-23 06:17:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fee1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:17:56, skipping insertion in model container [2022-07-23 06:17:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:17:56" (3/3) ... [2022-07-23 06:17:56,695 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-23 06:17:56,709 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:17:56,710 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-23 06:17:56,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:17:56,757 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@badfa6c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c47ff85 [2022-07-23 06:17:56,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-23 06:17:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:17:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:17:56,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:56,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:17:56,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:17:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:56,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562910375] [2022-07-23 06:17:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:56,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:56,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:56,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:56,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 06:17:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:56,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:17:56,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:56,895 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-23 06:17:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:56,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:56,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562910375] [2022-07-23 06:17:56,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562910375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:56,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:56,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:17:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785196383] [2022-07-23 06:17:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:56,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:17:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:56,956 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:57,116 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-23 06:17:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:57,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:17:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:57,123 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:17:57,123 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:17:57,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:57,127 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:57,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:17:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-23 06:17:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:17:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-23 06:17:57,156 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-07-23 06:17:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:57,157 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-23 06:17:57,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-23 06:17:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:17:57,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:57,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:17:57,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:57,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:17:57,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:17:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:57,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991885277] [2022-07-23 06:17:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:57,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:57,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:57,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 06:17:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:57,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:17:57,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:57,405 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-23 06:17:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:57,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:57,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:57,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991885277] [2022-07-23 06:17:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991885277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:57,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:57,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:17:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714948484] [2022-07-23 06:17:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:57,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:17:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:57,416 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:57,590 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-23 06:17:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:17:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:57,592 INFO L225 Difference]: With dead ends: 102 [2022-07-23 06:17:57,592 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 06:17:57,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:57,593 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:57,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 06:17:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-23 06:17:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:17:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-23 06:17:57,600 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-07-23 06:17:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:57,600 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-23 06:17:57,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-23 06:17:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 06:17:57,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:57,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:57,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:57,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:17:57,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-07-23 06:17:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:57,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757660507] [2022-07-23 06:17:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:57,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:57,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 06:17:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:57,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:17:57,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:57,908 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-23 06:17:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:57,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:57,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757660507] [2022-07-23 06:17:57,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757660507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:57,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:17:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989686636] [2022-07-23 06:17:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:57,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:17:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:57,922 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:58,109 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-07-23 06:17:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 06:17:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:58,111 INFO L225 Difference]: With dead ends: 165 [2022-07-23 06:17:58,111 INFO L226 Difference]: Without dead ends: 165 [2022-07-23 06:17:58,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:58,112 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:58,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-23 06:17:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-07-23 06:17:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:17:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-23 06:17:58,128 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-07-23 06:17:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:58,128 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-23 06:17:58,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-23 06:17:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 06:17:58,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:58,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:58,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:58,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:17:58,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-07-23 06:17:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742846796] [2022-07-23 06:17:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:58,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:58,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 06:17:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:58,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:17:58,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:58,406 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-23 06:17:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:58,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:58,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742846796] [2022-07-23 06:17:58,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742846796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:58,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:58,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:17:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564129341] [2022-07-23 06:17:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:17:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:58,420 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:58,640 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-07-23 06:17:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:58,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 06:17:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:58,641 INFO L225 Difference]: With dead ends: 165 [2022-07-23 06:17:58,642 INFO L226 Difference]: Without dead ends: 165 [2022-07-23 06:17:58,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:58,643 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:58,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-23 06:17:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-07-23 06:17:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:17:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-23 06:17:58,670 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-07-23 06:17:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:58,670 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-23 06:17:58,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-23 06:17:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:17:58,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:58,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:58,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:58,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:17:58,878 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-07-23 06:17:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211587977] [2022-07-23 06:17:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:58,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:58,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 06:17:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:58,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:17:58,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:59,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:59,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:59,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211587977] [2022-07-23 06:17:59,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211587977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:59,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:59,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:17:59,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857987613] [2022-07-23 06:17:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:17:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:17:59,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:17:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:17:59,006 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:59,126 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-07-23 06:17:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:17:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:17:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:59,128 INFO L225 Difference]: With dead ends: 174 [2022-07-23 06:17:59,128 INFO L226 Difference]: Without dead ends: 174 [2022-07-23 06:17:59,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:17:59,129 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 225 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:59,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 393 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-23 06:17:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2022-07-23 06:17:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:17:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-07-23 06:17:59,137 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-07-23 06:17:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:59,137 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-07-23 06:17:59,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-07-23 06:17:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:17:59,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:59,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:59,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:17:59,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-07-23 06:17:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029713550] [2022-07-23 06:17:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:59,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:59,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 06:17:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:59,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:17:59,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:59,425 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-23 06:17:59,475 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:59,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:17:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:59,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:59,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029713550] [2022-07-23 06:17:59,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029713550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:59,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:59,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:17:59,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214461643] [2022-07-23 06:17:59,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:59,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:17:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:17:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:17:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:17:59,500 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:59,669 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2022-07-23 06:17:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:17:59,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:17:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:59,673 INFO L225 Difference]: With dead ends: 141 [2022-07-23 06:17:59,673 INFO L226 Difference]: Without dead ends: 141 [2022-07-23 06:17:59,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:17:59,675 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 143 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:59,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 105 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-23 06:17:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-23 06:17:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.8709677419354838) internal successors, (174), 128 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:17:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2022-07-23 06:17:59,682 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 10 [2022-07-23 06:17:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:59,682 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2022-07-23 06:17:59,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2022-07-23 06:17:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:17:59,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:59,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:59,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:59,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:17:59,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:17:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620372, now seen corresponding path program 1 times [2022-07-23 06:17:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:17:59,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052606055] [2022-07-23 06:17:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:59,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:17:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:17:59,901 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:17:59,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 06:17:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:59,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:17:59,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:59,964 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-23 06:17:59,985 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:17:59,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:17:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:59,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:17:59,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:17:59,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052606055] [2022-07-23 06:17:59,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052606055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:59,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:59,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:17:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494522694] [2022-07-23 06:18:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:00,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:18:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:18:00,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:18:00,001 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:00,133 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-07-23 06:18:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:18:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:18:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:00,134 INFO L225 Difference]: With dead ends: 140 [2022-07-23 06:18:00,134 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 06:18:00,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:18:00,135 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 140 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:00,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 104 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:18:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 06:18:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-23 06:18:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:18:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-07-23 06:18:00,140 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-07-23 06:18:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:00,140 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-07-23 06:18:00,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-07-23 06:18:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:18:00,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:00,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:00,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-23 06:18:00,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:00,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-07-23 06:18:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:00,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561237416] [2022-07-23 06:18:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:00,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:00,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:00,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:00,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 06:18:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:00,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:18:00,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:00,408 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-23 06:18:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:00,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:00,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:00,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561237416] [2022-07-23 06:18:00,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561237416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:00,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:00,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:18:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18182090] [2022-07-23 06:18:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:00,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:00,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:00,459 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:00,793 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-07-23 06:18:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:18:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-23 06:18:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:00,795 INFO L225 Difference]: With dead ends: 163 [2022-07-23 06:18:00,795 INFO L226 Difference]: Without dead ends: 163 [2022-07-23 06:18:00,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:18:00,796 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 246 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:00,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 231 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 211 Invalid, 0 Unknown, 19 Unchecked, 0.3s Time] [2022-07-23 06:18:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-23 06:18:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-07-23 06:18:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 125 states have internal predecessors, (164), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:18:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2022-07-23 06:18:00,801 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 15 [2022-07-23 06:18:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:00,801 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2022-07-23 06:18:00,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2022-07-23 06:18:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:18:00,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:00,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:00,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:01,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:01,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-07-23 06:18:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:01,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757575321] [2022-07-23 06:18:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:01,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:01,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:01,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:01,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 06:18:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:01,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:18:01,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:01,071 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-23 06:18:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:01,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:01,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:01,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757575321] [2022-07-23 06:18:01,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757575321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:01,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:01,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:18:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539048825] [2022-07-23 06:18:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:01,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:01,142 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:01,556 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-07-23 06:18:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-23 06:18:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:01,558 INFO L225 Difference]: With dead ends: 159 [2022-07-23 06:18:01,558 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 06:18:01,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:01,558 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 186 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:01,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 261 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 225 Invalid, 0 Unknown, 17 Unchecked, 0.4s Time] [2022-07-23 06:18:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 06:18:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2022-07-23 06:18:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 125 states have internal predecessors, (158), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-23 06:18:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2022-07-23 06:18:01,563 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 15 [2022-07-23 06:18:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:01,563 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2022-07-23 06:18:01,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2022-07-23 06:18:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:18:01,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:01,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:01,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:01,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:01,772 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-07-23 06:18:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:01,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265338693] [2022-07-23 06:18:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:01,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:01,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:01,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:01,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 06:18:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:01,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:18:01,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:01,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:01,897 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:18:01,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 06:18:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:01,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:01,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265338693] [2022-07-23 06:18:01,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265338693] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:01,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:01,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-23 06:18:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377430084] [2022-07-23 06:18:01,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:01,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:01,909 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:02,167 INFO L93 Difference]: Finished difference Result 151 states and 193 transitions. [2022-07-23 06:18:02,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:18:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:02,168 INFO L225 Difference]: With dead ends: 151 [2022-07-23 06:18:02,168 INFO L226 Difference]: Without dead ends: 151 [2022-07-23 06:18:02,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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-23 06:18:02,169 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 155 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:02,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 186 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:18:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-23 06:18:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-07-23 06:18:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 131 states have internal predecessors, (168), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 06:18:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-07-23 06:18:02,173 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 16 [2022-07-23 06:18:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:02,174 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-07-23 06:18:02,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-07-23 06:18:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:18:02,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:02,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:02,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:02,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:02,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:02,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-07-23 06:18:02,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:02,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170375152] [2022-07-23 06:18:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:02,384 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:02,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 06:18:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:02,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:18:02,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:02,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:02,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:02,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-23 06:18:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:02,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:02,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170375152] [2022-07-23 06:18:02,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170375152] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:02,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:02,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-23 06:18:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831011343] [2022-07-23 06:18:02,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:02,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:18:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:18:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:18:02,881 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:03,569 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2022-07-23 06:18:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:18:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:03,570 INFO L225 Difference]: With dead ends: 148 [2022-07-23 06:18:03,570 INFO L226 Difference]: Without dead ends: 148 [2022-07-23 06:18:03,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:18:03,571 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 288 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:03,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 258 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 06:18:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-23 06:18:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2022-07-23 06:18:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 130 states have internal predecessors, (165), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 06:18:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2022-07-23 06:18:03,574 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 16 [2022-07-23 06:18:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:03,575 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2022-07-23 06:18:03,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2022-07-23 06:18:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 06:18:03,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:03,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:03,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-23 06:18:03,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:03,776 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-07-23 06:18:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:03,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037818634] [2022-07-23 06:18:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:03,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:03,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:03,778 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:03,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 06:18:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:03,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:18:03,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:03,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:03,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:03,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:03,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:04,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:04,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:04,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037818634] [2022-07-23 06:18:04,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037818634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:04,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:04,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:18:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564946251] [2022-07-23 06:18:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:04,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:18:04,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:04,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:18:04,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:18:04,012 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:04,167 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-07-23 06:18:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:18:04,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-23 06:18:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:04,168 INFO L225 Difference]: With dead ends: 159 [2022-07-23 06:18:04,168 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 06:18:04,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:18:04,169 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 15 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:04,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 356 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-23 06:18:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 06:18:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2022-07-23 06:18:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5663716814159292) internal successors, (177), 140 states have internal predecessors, (177), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-23 06:18:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 201 transitions. [2022-07-23 06:18:04,173 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 201 transitions. Word has length 19 [2022-07-23 06:18:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:04,174 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 201 transitions. [2022-07-23 06:18:04,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 201 transitions. [2022-07-23 06:18:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:18:04,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:04,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:04,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:04,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-07-23 06:18:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:04,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679318498] [2022-07-23 06:18:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:04,385 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:04,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 06:18:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:04,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:18:04,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:04,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:04,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:04,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:04,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:04,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:04,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:04,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:04,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:04,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679318498] [2022-07-23 06:18:04,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679318498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:04,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:04,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:18:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956482869] [2022-07-23 06:18:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:04,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:18:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:18:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:04,612 INFO L87 Difference]: Start difference. First operand 158 states and 201 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:04,728 INFO L93 Difference]: Finished difference Result 193 states and 243 transitions. [2022-07-23 06:18:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:18:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-23 06:18:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:04,730 INFO L225 Difference]: With dead ends: 193 [2022-07-23 06:18:04,730 INFO L226 Difference]: Without dead ends: 193 [2022-07-23 06:18:04,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:18:04,730 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 92 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:04,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 458 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-23 06:18:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-23 06:18:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 160. [2022-07-23 06:18:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.5565217391304347) internal successors, (179), 142 states have internal predecessors, (179), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-23 06:18:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 203 transitions. [2022-07-23 06:18:04,735 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 203 transitions. Word has length 21 [2022-07-23 06:18:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:04,735 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 203 transitions. [2022-07-23 06:18:04,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 203 transitions. [2022-07-23 06:18:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:18:04,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:04,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:04,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:04,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:04,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-07-23 06:18:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:04,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775919772] [2022-07-23 06:18:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:04,938 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:04,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 06:18:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:05,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:18:05,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:05,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:05,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:05,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:05,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:05,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:05,548 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 35 treesize of output 29 [2022-07-23 06:18:05,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:05,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:05,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:05,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775919772] [2022-07-23 06:18:05,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775919772] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:05,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:05,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-07-23 06:18:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198304258] [2022-07-23 06:18:05,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:05,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 06:18:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 06:18:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:18:05,572 INFO L87 Difference]: Start difference. First operand 160 states and 203 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:07,384 INFO L93 Difference]: Finished difference Result 417 states and 537 transitions. [2022-07-23 06:18:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:18:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 06:18:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:07,386 INFO L225 Difference]: With dead ends: 417 [2022-07-23 06:18:07,387 INFO L226 Difference]: Without dead ends: 417 [2022-07-23 06:18:07,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:18:07,387 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 400 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:07,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1726 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-23 06:18:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-23 06:18:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 195. [2022-07-23 06:18:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 171 states have internal predecessors, (223), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-23 06:18:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 257 transitions. [2022-07-23 06:18:07,396 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 257 transitions. Word has length 22 [2022-07-23 06:18:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:07,396 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 257 transitions. [2022-07-23 06:18:07,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 257 transitions. [2022-07-23 06:18:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:18:07,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:07,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:07,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:07,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:07,604 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-07-23 06:18:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:07,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267856300] [2022-07-23 06:18:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:07,607 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:07,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 06:18:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:07,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:18:07,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:07,681 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-23 06:18:07,693 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:07,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:07,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:07,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:07,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267856300] [2022-07-23 06:18:07,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267856300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:07,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:07,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-07-23 06:18:07,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984934057] [2022-07-23 06:18:07,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:07,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:18:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:07,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:18:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:07,801 INFO L87 Difference]: Start difference. First operand 195 states and 257 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:08,381 INFO L93 Difference]: Finished difference Result 259 states and 313 transitions. [2022-07-23 06:18:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:08,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-23 06:18:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:08,383 INFO L225 Difference]: With dead ends: 259 [2022-07-23 06:18:08,383 INFO L226 Difference]: Without dead ends: 255 [2022-07-23 06:18:08,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:18:08,384 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 241 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:08,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 412 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:18:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-23 06:18:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 195. [2022-07-23 06:18:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 171 states have internal predecessors, (221), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-23 06:18:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2022-07-23 06:18:08,389 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 21 [2022-07-23 06:18:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:08,390 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2022-07-23 06:18:08,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2022-07-23 06:18:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:18:08,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:08,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:08,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-23 06:18:08,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:08,597 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:08,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-07-23 06:18:08,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:08,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210513424] [2022-07-23 06:18:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:08,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:08,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:08,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 06:18:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:08,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:18:08,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:08,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:08,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:08,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210513424] [2022-07-23 06:18:08,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210513424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:08,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:08,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:18:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236625404] [2022-07-23 06:18:08,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:08,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:08,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:08,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:08,718 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:08,782 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2022-07-23 06:18:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:08,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-23 06:18:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:08,783 INFO L225 Difference]: With dead ends: 219 [2022-07-23 06:18:08,783 INFO L226 Difference]: Without dead ends: 219 [2022-07-23 06:18:08,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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-23 06:18:08,784 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 53 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:08,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 466 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:18:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-23 06:18:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2022-07-23 06:18:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 175 states have internal predecessors, (222), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-23 06:18:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 258 transitions. [2022-07-23 06:18:08,788 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 258 transitions. Word has length 24 [2022-07-23 06:18:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:08,789 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 258 transitions. [2022-07-23 06:18:08,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 06:18:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 258 transitions. [2022-07-23 06:18:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:18:08,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:08,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:08,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:08,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:08,997 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-07-23 06:18:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:08,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766105683] [2022-07-23 06:18:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:08,999 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:09,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 06:18:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:09,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:18:09,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:09,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:09,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:09,361 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 40 treesize of output 34 [2022-07-23 06:18:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:09,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:09,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766105683] [2022-07-23 06:18:09,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766105683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:09,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:09,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-07-23 06:18:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030830140] [2022-07-23 06:18:09,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:09,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:18:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:09,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:18:09,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:18:09,391 INFO L87 Difference]: Start difference. First operand 199 states and 258 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:09,979 INFO L93 Difference]: Finished difference Result 311 states and 401 transitions. [2022-07-23 06:18:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:18:09,979 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-23 06:18:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:09,982 INFO L225 Difference]: With dead ends: 311 [2022-07-23 06:18:09,982 INFO L226 Difference]: Without dead ends: 305 [2022-07-23 06:18:09,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:18:09,983 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 199 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:09,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 818 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 313 Invalid, 0 Unknown, 171 Unchecked, 0.6s Time] [2022-07-23 06:18:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-23 06:18:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 218. [2022-07-23 06:18:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.509433962264151) internal successors, (240), 191 states have internal predecessors, (240), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-23 06:18:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 286 transitions. [2022-07-23 06:18:09,994 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 286 transitions. Word has length 23 [2022-07-23 06:18:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:09,994 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 286 transitions. [2022-07-23 06:18:09,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 286 transitions. [2022-07-23 06:18:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:18:09,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:09,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:10,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:10,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:10,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-07-23 06:18:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:10,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760421030] [2022-07-23 06:18:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:10,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:10,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:10,206 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:10,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 06:18:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:10,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:18:10,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:10,325 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-23 06:18:10,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:10,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:18:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:10,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:10,461 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 42 treesize of output 36 [2022-07-23 06:18:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:10,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:10,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760421030] [2022-07-23 06:18:10,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760421030] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:10,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:10,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-23 06:18:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940093501] [2022-07-23 06:18:10,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:10,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:18:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:18:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:18:10,544 INFO L87 Difference]: Start difference. First operand 218 states and 286 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:10,961 INFO L93 Difference]: Finished difference Result 286 states and 362 transitions. [2022-07-23 06:18:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:18:10,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-23 06:18:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:10,962 INFO L225 Difference]: With dead ends: 286 [2022-07-23 06:18:10,962 INFO L226 Difference]: Without dead ends: 286 [2022-07-23 06:18:10,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:18:10,963 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:10,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 518 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 233 Invalid, 0 Unknown, 163 Unchecked, 0.4s Time] [2022-07-23 06:18:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-23 06:18:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 218. [2022-07-23 06:18:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 191 states have internal predecessors, (239), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-23 06:18:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2022-07-23 06:18:10,969 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 25 [2022-07-23 06:18:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:10,969 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2022-07-23 06:18:10,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2022-07-23 06:18:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:18:10,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:10,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:10,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-23 06:18:11,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:11,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-07-23 06:18:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:11,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553807965] [2022-07-23 06:18:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:11,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:11,181 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:11,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 06:18:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:11,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:18:11,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:11,295 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-23 06:18:11,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:11,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:11,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:18:11,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:11,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:11,644 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 48 treesize of output 36 [2022-07-23 06:18:11,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:11,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:11,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:11,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:11,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:11,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553807965] [2022-07-23 06:18:11,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553807965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:11,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:11,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-23 06:18:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590547195] [2022-07-23 06:18:11,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:18:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:18:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:18:11,757 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:12,876 INFO L93 Difference]: Finished difference Result 289 states and 364 transitions. [2022-07-23 06:18:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:18:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-23 06:18:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:12,877 INFO L225 Difference]: With dead ends: 289 [2022-07-23 06:18:12,877 INFO L226 Difference]: Without dead ends: 289 [2022-07-23 06:18:12,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:18:12,878 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:12,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 564 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 340 Invalid, 0 Unknown, 72 Unchecked, 1.0s Time] [2022-07-23 06:18:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-23 06:18:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 218. [2022-07-23 06:18:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 191 states have internal predecessors, (238), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-23 06:18:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 284 transitions. [2022-07-23 06:18:12,883 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 284 transitions. Word has length 25 [2022-07-23 06:18:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:12,883 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 284 transitions. [2022-07-23 06:18:12,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 284 transitions. [2022-07-23 06:18:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:18:12,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:12,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:12,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:13,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:13,092 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-07-23 06:18:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:13,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530049096] [2022-07-23 06:18:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:13,094 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:13,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-23 06:18:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:13,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:18:13,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:13,163 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-23 06:18:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:13,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:13,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:13,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530049096] [2022-07-23 06:18:13,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530049096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:13,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:13,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:18:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90419394] [2022-07-23 06:18:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:13,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:13,219 INFO L87 Difference]: Start difference. First operand 218 states and 284 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:13,656 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2022-07-23 06:18:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:18:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-23 06:18:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:13,658 INFO L225 Difference]: With dead ends: 231 [2022-07-23 06:18:13,658 INFO L226 Difference]: Without dead ends: 231 [2022-07-23 06:18:13,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:18:13,658 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 160 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:13,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 226 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 17 Unchecked, 0.4s Time] [2022-07-23 06:18:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-23 06:18:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2022-07-23 06:18:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 191 states have internal predecessors, (232), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-23 06:18:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 278 transitions. [2022-07-23 06:18:13,664 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 278 transitions. Word has length 27 [2022-07-23 06:18:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:13,664 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 278 transitions. [2022-07-23 06:18:13,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 278 transitions. [2022-07-23 06:18:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:18:13,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:13,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:13,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:13,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:13,872 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-07-23 06:18:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:13,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45365101] [2022-07-23 06:18:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:13,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:13,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:13,874 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:13,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 06:18:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:13,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:18:13,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:13,943 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-23 06:18:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:14,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:14,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:14,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45365101] [2022-07-23 06:18:14,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45365101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:14,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:14,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:18:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732951646] [2022-07-23 06:18:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:14,036 INFO L87 Difference]: Start difference. First operand 219 states and 278 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:14,362 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2022-07-23 06:18:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-23 06:18:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:14,363 INFO L225 Difference]: With dead ends: 229 [2022-07-23 06:18:14,363 INFO L226 Difference]: Without dead ends: 229 [2022-07-23 06:18:14,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:14,364 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 137 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:14,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 224 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2022-07-23 06:18:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-23 06:18:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2022-07-23 06:18:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 162 states have (on average 1.4074074074074074) internal successors, (228), 191 states have internal predecessors, (228), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-23 06:18:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 274 transitions. [2022-07-23 06:18:14,368 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 274 transitions. Word has length 27 [2022-07-23 06:18:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:14,369 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 274 transitions. [2022-07-23 06:18:14,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 274 transitions. [2022-07-23 06:18:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:18:14,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:14,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:14,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-23 06:18:14,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:14,576 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -815173775, now seen corresponding path program 1 times [2022-07-23 06:18:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:14,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017697529] [2022-07-23 06:18:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:14,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:14,578 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:14,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-23 06:18:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:14,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:18:14,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:14,714 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-23 06:18:14,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:14,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:18:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:14,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:14,833 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 42 treesize of output 36 [2022-07-23 06:18:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:14,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:14,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017697529] [2022-07-23 06:18:14,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017697529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:14,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:14,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-07-23 06:18:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6628785] [2022-07-23 06:18:14,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:14,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:18:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:18:14,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:18:14,939 INFO L87 Difference]: Start difference. First operand 219 states and 274 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:15,822 INFO L93 Difference]: Finished difference Result 313 states and 384 transitions. [2022-07-23 06:18:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:18:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 06:18:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:15,824 INFO L225 Difference]: With dead ends: 313 [2022-07-23 06:18:15,824 INFO L226 Difference]: Without dead ends: 311 [2022-07-23 06:18:15,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:18:15,825 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 250 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:15,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 614 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 570 Invalid, 0 Unknown, 49 Unchecked, 0.8s Time] [2022-07-23 06:18:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-23 06:18:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 231. [2022-07-23 06:18:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.4035087719298245) internal successors, (240), 200 states have internal predecessors, (240), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:18:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 288 transitions. [2022-07-23 06:18:15,840 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 288 transitions. Word has length 28 [2022-07-23 06:18:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:15,841 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 288 transitions. [2022-07-23 06:18:15,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 288 transitions. [2022-07-23 06:18:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:18:15,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:15,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:15,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:16,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:16,051 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-07-23 06:18:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:16,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526359253] [2022-07-23 06:18:16,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:16,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:16,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:16,054 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:16,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-23 06:18:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:16,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:18:16,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:16,205 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-23 06:18:16,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:16,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:16,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:18:16,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:16,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:16,800 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 78 treesize of output 72 [2022-07-23 06:18:16,802 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 118 treesize of output 106 [2022-07-23 06:18:16,933 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 52 treesize of output 40 [2022-07-23 06:18:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:17,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:17,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526359253] [2022-07-23 06:18:17,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526359253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:17,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:17,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-07-23 06:18:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914220959] [2022-07-23 06:18:17,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:17,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 06:18:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 06:18:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:18:17,174 INFO L87 Difference]: Start difference. First operand 231 states and 288 transitions. Second operand has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:19,404 INFO L93 Difference]: Finished difference Result 304 states and 374 transitions. [2022-07-23 06:18:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:18:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 06:18:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:19,406 INFO L225 Difference]: With dead ends: 304 [2022-07-23 06:18:19,406 INFO L226 Difference]: Without dead ends: 304 [2022-07-23 06:18:19,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-23 06:18:19,407 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 265 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:19,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 699 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-23 06:18:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-23 06:18:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 231. [2022-07-23 06:18:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.3976608187134503) internal successors, (239), 200 states have internal predecessors, (239), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:18:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 287 transitions. [2022-07-23 06:18:19,413 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 287 transitions. Word has length 28 [2022-07-23 06:18:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:19,413 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 287 transitions. [2022-07-23 06:18:19,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 287 transitions. [2022-07-23 06:18:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:18:19,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:19,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:19,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:19,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:19,622 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-07-23 06:18:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:19,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204691909] [2022-07-23 06:18:19,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:19,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:19,623 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:19,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-23 06:18:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:19,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:18:19,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:19,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:19,796 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 20 treesize of output 8 [2022-07-23 06:18:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:19,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:19,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-23 06:18:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:19,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:19,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204691909] [2022-07-23 06:18:19,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204691909] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:19,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:19,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2022-07-23 06:18:19,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381383716] [2022-07-23 06:18:19,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:19,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:18:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:19,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:18:19,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:19,852 INFO L87 Difference]: Start difference. First operand 231 states and 287 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:20,125 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2022-07-23 06:18:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:18:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-23 06:18:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:20,129 INFO L225 Difference]: With dead ends: 258 [2022-07-23 06:18:20,129 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 06:18:20,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:18:20,130 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:20,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 522 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2022-07-23 06:18:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 06:18:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2022-07-23 06:18:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.391812865497076) internal successors, (238), 200 states have internal predecessors, (238), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:18:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2022-07-23 06:18:20,135 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 27 [2022-07-23 06:18:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:20,135 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2022-07-23 06:18:20,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2022-07-23 06:18:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:18:20,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:20,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:20,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:20,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:20,343 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-07-23 06:18:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:20,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609271823] [2022-07-23 06:18:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:20,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:20,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:20,345 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:20,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-23 06:18:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:20,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 06:18:20,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:20,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:20,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:20,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:20,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:18:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:20,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:20,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:20,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609271823] [2022-07-23 06:18:20,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609271823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:20,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:20,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:18:20,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875312459] [2022-07-23 06:18:20,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:20,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:18:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:18:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:18:20,616 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:20,863 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2022-07-23 06:18:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:18:20,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-23 06:18:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:20,865 INFO L225 Difference]: With dead ends: 255 [2022-07-23 06:18:20,865 INFO L226 Difference]: Without dead ends: 255 [2022-07-23 06:18:20,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:18:20,868 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:20,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 382 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-07-23 06:18:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-23 06:18:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2022-07-23 06:18:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 179 states have (on average 1.3743016759776536) internal successors, (246), 208 states have internal predecessors, (246), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 19 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 06:18:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 296 transitions. [2022-07-23 06:18:20,881 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 296 transitions. Word has length 30 [2022-07-23 06:18:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:20,882 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 296 transitions. [2022-07-23 06:18:20,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 296 transitions. [2022-07-23 06:18:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:18:20,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:20,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:20,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-23 06:18:21,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:21,087 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1096750777, now seen corresponding path program 1 times [2022-07-23 06:18:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:21,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331584989] [2022-07-23 06:18:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:21,089 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:21,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-23 06:18:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:21,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:18:21,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:21,183 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-23 06:18:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:18:21,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:21,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:21,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331584989] [2022-07-23 06:18:21,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331584989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:21,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:21,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:18:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180545398] [2022-07-23 06:18:21,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:21,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:21,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:21,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:21,239 INFO L87 Difference]: Start difference. First operand 241 states and 296 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:21,538 INFO L93 Difference]: Finished difference Result 304 states and 365 transitions. [2022-07-23 06:18:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:18:21,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-23 06:18:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:21,539 INFO L225 Difference]: With dead ends: 304 [2022-07-23 06:18:21,539 INFO L226 Difference]: Without dead ends: 304 [2022-07-23 06:18:21,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:21,540 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 131 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:21,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 232 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2022-07-23 06:18:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-23 06:18:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 254. [2022-07-23 06:18:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 218 states have internal predecessors, (255), 26 states have call successors, (26), 15 states have call predecessors, (26), 15 states have return successors, (26), 20 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-23 06:18:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 307 transitions. [2022-07-23 06:18:21,544 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 307 transitions. Word has length 30 [2022-07-23 06:18:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:21,544 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 307 transitions. [2022-07-23 06:18:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 307 transitions. [2022-07-23 06:18:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:18:21,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:21,545 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:21,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:21,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:21,747 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1096750776, now seen corresponding path program 1 times [2022-07-23 06:18:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:21,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178840028] [2022-07-23 06:18:21,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:21,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:21,749 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:21,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-23 06:18:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:21,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:18:21,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:21,850 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-23 06:18:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:18:21,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:21,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178840028] [2022-07-23 06:18:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178840028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:21,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:21,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:18:21,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973972607] [2022-07-23 06:18:21,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:21,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:21,926 INFO L87 Difference]: Start difference. First operand 254 states and 307 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:22,042 INFO L93 Difference]: Finished difference Result 272 states and 327 transitions. [2022-07-23 06:18:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:18:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-23 06:18:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:22,043 INFO L225 Difference]: With dead ends: 272 [2022-07-23 06:18:22,043 INFO L226 Difference]: Without dead ends: 272 [2022-07-23 06:18:22,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:22,044 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:22,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 201 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-07-23 06:18:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-23 06:18:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2022-07-23 06:18:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 197 states have (on average 1.3401015228426396) internal successors, (264), 226 states have internal predecessors, (264), 26 states have call successors, (26), 15 states have call predecessors, (26), 15 states have return successors, (26), 20 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-23 06:18:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 316 transitions. [2022-07-23 06:18:22,051 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 316 transitions. Word has length 30 [2022-07-23 06:18:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:22,051 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 316 transitions. [2022-07-23 06:18:22,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 316 transitions. [2022-07-23 06:18:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:18:22,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:22,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:22,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-23 06:18:22,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:22,260 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-07-23 06:18:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:22,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925683745] [2022-07-23 06:18:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:22,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:22,262 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:22,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-23 06:18:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:22,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:18:22,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:22,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:22,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:22,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:22,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:22,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925683745] [2022-07-23 06:18:22,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925683745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:22,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:22,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:18:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362474388] [2022-07-23 06:18:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:22,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:18:22,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:18:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:18:22,463 INFO L87 Difference]: Start difference. First operand 262 states and 316 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:22,779 INFO L93 Difference]: Finished difference Result 337 states and 403 transitions. [2022-07-23 06:18:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:18:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-23 06:18:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:22,780 INFO L225 Difference]: With dead ends: 337 [2022-07-23 06:18:22,780 INFO L226 Difference]: Without dead ends: 337 [2022-07-23 06:18:22,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:18:22,781 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 87 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:22,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 483 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-07-23 06:18:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-23 06:18:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 293. [2022-07-23 06:18:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 251 states have internal predecessors, (293), 30 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-23 06:18:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 353 transitions. [2022-07-23 06:18:22,786 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 353 transitions. Word has length 32 [2022-07-23 06:18:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:22,786 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 353 transitions. [2022-07-23 06:18:22,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 353 transitions. [2022-07-23 06:18:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:18:22,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:22,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:22,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:22,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:22,994 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-07-23 06:18:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:22,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499444817] [2022-07-23 06:18:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:22,996 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:22,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-23 06:18:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:23,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-23 06:18:23,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:23,128 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-23 06:18:23,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:23,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:23,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:23,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:23,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:23,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:23,210 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:23,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:23,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:23,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:23,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:23,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:23,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:23,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:23,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:23,495 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:23,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-23 06:18:23,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:18:23,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:23,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:23,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2022-07-23 06:18:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:23,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:23,563 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_793) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_794) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)))) is different from false [2022-07-23 06:18:23,576 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_794) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_793) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:23,596 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_793) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_794) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:23,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499444817] [2022-07-23 06:18:23,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499444817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [320800936] [2022-07-23 06:18:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:18:23,618 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:18:23,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-07-23 06:18:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:23,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 06:18:23,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:23,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:23,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:23,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:23,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:23,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:23,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:24,047 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:24,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:24,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:24,069 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:24,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:24,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:24,154 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:24,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:24,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:24,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:24,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:24,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:24,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:24,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:24,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:24,832 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:24,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-23 06:18:24,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:24,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:18:24,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:24,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:24,930 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_854) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|))) (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_853) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)))) is different from false [2022-07-23 06:18:24,945 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_854) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_853) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:24,962 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_853) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_854) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:24,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [320800936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:24,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:24,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-07-23 06:18:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420177578] [2022-07-23 06:18:24,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:24,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:18:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:18:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=396, Unknown=6, NotChecked=270, Total=756 [2022-07-23 06:18:24,985 INFO L87 Difference]: Start difference. First operand 293 states and 353 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:25,357 INFO L93 Difference]: Finished difference Result 329 states and 394 transitions. [2022-07-23 06:18:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:18:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-23 06:18:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:25,358 INFO L225 Difference]: With dead ends: 329 [2022-07-23 06:18:25,358 INFO L226 Difference]: Without dead ends: 329 [2022-07-23 06:18:25,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=550, Unknown=6, NotChecked=318, Total=992 [2022-07-23 06:18:25,359 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:25,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 772 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 159 Invalid, 0 Unknown, 157 Unchecked, 0.2s Time] [2022-07-23 06:18:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-23 06:18:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 315. [2022-07-23 06:18:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 271 states have internal predecessors, (315), 31 states have call successors, (31), 19 states have call predecessors, (31), 19 states have return successors, (31), 24 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-23 06:18:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 377 transitions. [2022-07-23 06:18:25,363 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 377 transitions. Word has length 31 [2022-07-23 06:18:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:25,364 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 377 transitions. [2022-07-23 06:18:25,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 377 transitions. [2022-07-23 06:18:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:18:25,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:25,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:25,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:25,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:25,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:25,765 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 2 times [2022-07-23 06:18:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:25,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124146851] [2022-07-23 06:18:25,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:18:25,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:25,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:25,767 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:25,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-23 06:18:25,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:18:25,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:18:25,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:18:25,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:25,966 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:25,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:25,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:26,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:26,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:26,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-23 06:18:26,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:26,324 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-23 06:18:26,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-07-23 06:18:26,337 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:18:26,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-23 06:18:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:26,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:27,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:27,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2493 treesize of output 2242 [2022-07-23 06:18:27,440 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 2616 treesize of output 2514 [2022-07-23 06:18:31,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 378 [2022-07-23 06:18:32,319 INFO L356 Elim1Store]: treesize reduction 425, result has 15.3 percent of original size [2022-07-23 06:18:32,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 5200 treesize of output 4874 [2022-07-23 06:18:33,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:33,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 96 [2022-07-23 06:18:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:33,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124146851] [2022-07-23 06:18:33,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124146851] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:33,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:33,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2022-07-23 06:18:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667925176] [2022-07-23 06:18:33,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:33,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:18:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:33,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:18:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:18:33,610 INFO L87 Difference]: Start difference. First operand 315 states and 377 transitions. Second operand has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:35,839 INFO L93 Difference]: Finished difference Result 463 states and 560 transitions. [2022-07-23 06:18:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:18:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 06:18:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:35,841 INFO L225 Difference]: With dead ends: 463 [2022-07-23 06:18:35,841 INFO L226 Difference]: Without dead ends: 463 [2022-07-23 06:18:35,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:18:35,842 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 327 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:35,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1642 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1081 Invalid, 0 Unknown, 185 Unchecked, 1.9s Time] [2022-07-23 06:18:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-23 06:18:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 312. [2022-07-23 06:18:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 269 states have internal predecessors, (312), 30 states have call successors, (30), 19 states have call predecessors, (30), 19 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-23 06:18:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 372 transitions. [2022-07-23 06:18:35,848 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 372 transitions. Word has length 34 [2022-07-23 06:18:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:35,848 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 372 transitions. [2022-07-23 06:18:35,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 372 transitions. [2022-07-23 06:18:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:18:35,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:35,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:35,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-23 06:18:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:36,057 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1173956747, now seen corresponding path program 1 times [2022-07-23 06:18:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:36,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320338015] [2022-07-23 06:18:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:36,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:36,059 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:36,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-23 06:18:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:36,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 06:18:36,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:36,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:36,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:36,252 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:36,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:18:36,257 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 7 treesize of output 3 [2022-07-23 06:18:36,273 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:36,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:18:36,276 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 7 treesize of output 3 [2022-07-23 06:18:36,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:36,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:36,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:36,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:36,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-23 06:18:36,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:36,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2022-07-23 06:18:36,888 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 50 treesize of output 38 [2022-07-23 06:18:36,892 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 50 treesize of output 38 [2022-07-23 06:18:36,895 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 25 treesize of output 21 [2022-07-23 06:18:36,898 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 21 treesize of output 17 [2022-07-23 06:18:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:36,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:36,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320338015] [2022-07-23 06:18:36,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320338015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:36,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:36,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-07-23 06:18:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818660484] [2022-07-23 06:18:36,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:36,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:18:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:18:36,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2022-07-23 06:18:36,945 INFO L87 Difference]: Start difference. First operand 312 states and 372 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:18:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:38,716 INFO L93 Difference]: Finished difference Result 341 states and 388 transitions. [2022-07-23 06:18:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:18:38,717 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-07-23 06:18:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:38,718 INFO L225 Difference]: With dead ends: 341 [2022-07-23 06:18:38,718 INFO L226 Difference]: Without dead ends: 341 [2022-07-23 06:18:38,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=751, Unknown=1, NotChecked=0, Total=930 [2022-07-23 06:18:38,719 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 264 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:38,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1048 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 809 Invalid, 0 Unknown, 86 Unchecked, 1.1s Time] [2022-07-23 06:18:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-23 06:18:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285. [2022-07-23 06:18:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 244 states have internal predecessors, (276), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (27), 21 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-23 06:18:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 330 transitions. [2022-07-23 06:18:38,730 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 330 transitions. Word has length 34 [2022-07-23 06:18:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:38,730 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 330 transitions. [2022-07-23 06:18:38,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:18:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 330 transitions. [2022-07-23 06:18:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:18:38,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:38,731 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:38,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-23 06:18:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:38,939 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1047948467, now seen corresponding path program 1 times [2022-07-23 06:18:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:38,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130460145] [2022-07-23 06:18:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:38,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:38,940 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:38,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-23 06:18:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:39,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 06:18:39,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:39,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:39,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:39,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:39,143 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:39,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-23 06:18:39,146 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 18 treesize of output 12 [2022-07-23 06:18:39,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 06:18:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:39,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:39,685 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-23 06:18:39,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-07-23 06:18:39,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:39,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:39,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-23 06:18:39,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-23 06:18:39,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:39,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:39,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130460145] [2022-07-23 06:18:39,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130460145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:39,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:39,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-23 06:18:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513733350] [2022-07-23 06:18:39,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:39,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 06:18:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 06:18:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=428, Unknown=3, NotChecked=0, Total=506 [2022-07-23 06:18:39,799 INFO L87 Difference]: Start difference. First operand 285 states and 330 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:18:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:40,725 INFO L93 Difference]: Finished difference Result 332 states and 373 transitions. [2022-07-23 06:18:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:18:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-07-23 06:18:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:40,727 INFO L225 Difference]: With dead ends: 332 [2022-07-23 06:18:40,727 INFO L226 Difference]: Without dead ends: 332 [2022-07-23 06:18:40,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=707, Unknown=3, NotChecked=0, Total=870 [2022-07-23 06:18:40,727 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 271 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:40,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 867 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 499 Invalid, 0 Unknown, 190 Unchecked, 0.7s Time] [2022-07-23 06:18:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-23 06:18:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 300. [2022-07-23 06:18:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 231 states have (on average 1.2467532467532467) internal successors, (288), 256 states have internal predecessors, (288), 28 states have call successors, (28), 21 states have call predecessors, (28), 21 states have return successors, (28), 22 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-23 06:18:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 344 transitions. [2022-07-23 06:18:40,732 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 344 transitions. Word has length 36 [2022-07-23 06:18:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:40,732 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 344 transitions. [2022-07-23 06:18:40,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:18:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 344 transitions. [2022-07-23 06:18:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:18:40,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:40,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:40,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-23 06:18:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:40,941 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1047948466, now seen corresponding path program 1 times [2022-07-23 06:18:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:40,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317982596] [2022-07-23 06:18:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:40,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:40,943 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:40,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-23 06:18:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:41,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:18:41,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:41,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:41,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:41,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:41,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:41,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:41,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:41,186 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:41,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-07-23 06:18:41,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 06:18:41,213 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:41,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:41,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:41,595 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 31 treesize of output 19 [2022-07-23 06:18:41,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-23 06:18:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:41,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:42,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:42,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-07-23 06:18:42,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:42,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:42,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 105 [2022-07-23 06:18:42,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:42,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:42,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 110 [2022-07-23 06:18:42,894 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 84 treesize of output 72 [2022-07-23 06:18:42,898 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 74 treesize of output 70 [2022-07-23 06:18:42,901 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 86 treesize of output 78 [2022-07-23 06:18:42,905 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 65 treesize of output 63 [2022-07-23 06:18:42,907 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 63 treesize of output 59 [2022-07-23 06:18:42,909 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 59 treesize of output 57 [2022-07-23 06:18:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:43,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:43,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317982596] [2022-07-23 06:18:43,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317982596] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:43,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:43,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-23 06:18:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364110219] [2022-07-23 06:18:43,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 06:18:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 06:18:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2022-07-23 06:18:43,067 INFO L87 Difference]: Start difference. First operand 300 states and 344 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:18:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:45,568 INFO L93 Difference]: Finished difference Result 372 states and 425 transitions. [2022-07-23 06:18:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:18:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-07-23 06:18:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:45,569 INFO L225 Difference]: With dead ends: 372 [2022-07-23 06:18:45,569 INFO L226 Difference]: Without dead ends: 372 [2022-07-23 06:18:45,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=152, Invalid=839, Unknown=1, NotChecked=0, Total=992 [2022-07-23 06:18:45,570 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 578 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:45,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 974 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 770 Invalid, 0 Unknown, 205 Unchecked, 1.9s Time] [2022-07-23 06:18:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-23 06:18:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 301. [2022-07-23 06:18:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.2456896551724137) internal successors, (289), 257 states have internal predecessors, (289), 28 states have call successors, (28), 21 states have call predecessors, (28), 21 states have return successors, (28), 22 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-23 06:18:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 345 transitions. [2022-07-23 06:18:45,574 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 345 transitions. Word has length 36 [2022-07-23 06:18:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:45,575 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 345 transitions. [2022-07-23 06:18:45,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:18:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 345 transitions. [2022-07-23 06:18:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:18:45,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:45,576 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-23 06:18:45,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-23 06:18:45,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:45,779 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:45,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 108587800, now seen corresponding path program 1 times [2022-07-23 06:18:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:45,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233981147] [2022-07-23 06:18:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:45,781 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:45,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-23 06:18:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:45,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 06:18:45,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:45,904 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-23 06:18:45,953 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:45,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:45,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:46,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:46,305 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 40 treesize of output 34 [2022-07-23 06:18:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:18:46,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:46,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233981147] [2022-07-23 06:18:46,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233981147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:46,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:46,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-07-23 06:18:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706058450] [2022-07-23 06:18:46,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:46,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 06:18:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 06:18:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:18:46,454 INFO L87 Difference]: Start difference. First operand 301 states and 345 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:18:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:48,026 INFO L93 Difference]: Finished difference Result 404 states and 475 transitions. [2022-07-23 06:18:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:18:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-07-23 06:18:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:48,028 INFO L225 Difference]: With dead ends: 404 [2022-07-23 06:18:48,028 INFO L226 Difference]: Without dead ends: 404 [2022-07-23 06:18:48,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:18:48,028 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 305 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:48,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1052 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 925 Invalid, 0 Unknown, 183 Unchecked, 1.4s Time] [2022-07-23 06:18:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-23 06:18:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 338. [2022-07-23 06:18:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 289 states have internal predecessors, (328), 33 states have call successors, (33), 21 states have call predecessors, (33), 25 states have return successors, (38), 27 states have call predecessors, (38), 33 states have call successors, (38) [2022-07-23 06:18:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 399 transitions. [2022-07-23 06:18:48,034 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 399 transitions. Word has length 36 [2022-07-23 06:18:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:48,035 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 399 transitions. [2022-07-23 06:18:48,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:18:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 399 transitions. [2022-07-23 06:18:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:18:48,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:48,036 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 06:18:48,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:48,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:48,251 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:48,252 INFO L85 PathProgramCache]: Analyzing trace with hash 712532890, now seen corresponding path program 1 times [2022-07-23 06:18:48,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:48,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817966521] [2022-07-23 06:18:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:48,253 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:48,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-23 06:18:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:48,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:18:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:18:48,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:48,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817966521] [2022-07-23 06:18:48,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817966521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:48,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:48,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:18:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153026285] [2022-07-23 06:18:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:48,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:48,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:48,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:48,366 INFO L87 Difference]: Start difference. First operand 338 states and 399 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 06:18:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:48,399 INFO L93 Difference]: Finished difference Result 346 states and 408 transitions. [2022-07-23 06:18:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:18:48,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-23 06:18:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:48,401 INFO L225 Difference]: With dead ends: 346 [2022-07-23 06:18:48,401 INFO L226 Difference]: Without dead ends: 346 [2022-07-23 06:18:48,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:18:48,402 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:48,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:18:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-23 06:18:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2022-07-23 06:18:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 263 states have (on average 1.258555133079848) internal successors, (331), 292 states have internal predecessors, (331), 34 states have call successors, (34), 22 states have call predecessors, (34), 26 states have return successors, (39), 28 states have call predecessors, (39), 34 states have call successors, (39) [2022-07-23 06:18:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 404 transitions. [2022-07-23 06:18:48,408 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 404 transitions. Word has length 40 [2022-07-23 06:18:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:48,408 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 404 transitions. [2022-07-23 06:18:48,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 06:18:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 404 transitions. [2022-07-23 06:18:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:18:48,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:48,409 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-23 06:18:48,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:48,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:48,617 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1618735444, now seen corresponding path program 1 times [2022-07-23 06:18:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:48,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23956342] [2022-07-23 06:18:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:48,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:48,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:48,618 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:48,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-23 06:18:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:48,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:18:48,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 06:18:48,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:18:48,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23956342] [2022-07-23 06:18:48,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23956342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:18:48,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:18:48,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:18:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823897182] [2022-07-23 06:18:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:18:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:18:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:18:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:18:48,763 INFO L87 Difference]: Start difference. First operand 343 states and 404 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:48,782 INFO L93 Difference]: Finished difference Result 333 states and 381 transitions. [2022-07-23 06:18:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:18:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-07-23 06:18:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:48,784 INFO L225 Difference]: With dead ends: 333 [2022-07-23 06:18:48,784 INFO L226 Difference]: Without dead ends: 321 [2022-07-23 06:18:48,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:18:48,785 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:48,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:18:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-23 06:18:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 310. [2022-07-23 06:18:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 239 states have (on average 1.2384937238493723) internal successors, (296), 264 states have internal predecessors, (296), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 23 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-23 06:18:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 354 transitions. [2022-07-23 06:18:48,790 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 354 transitions. Word has length 38 [2022-07-23 06:18:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:48,790 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 354 transitions. [2022-07-23 06:18:48,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:18:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 354 transitions. [2022-07-23 06:18:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:18:48,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:48,791 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:48,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:48,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:18:48,999 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:48,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1368231683, now seen corresponding path program 2 times [2022-07-23 06:18:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:48,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965374738] [2022-07-23 06:18:49,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:18:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:49,001 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:49,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-23 06:18:49,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:18:49,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:18:49,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-23 06:18:49,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:49,190 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-23 06:18:49,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:49,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:49,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:49,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:49,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:49,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:49,258 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:49,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:49,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:49,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:49,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:49,383 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:49,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:49,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:49,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:49,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:49,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:49,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:49,660 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:49,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-23 06:18:49,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:18:49,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:49,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:49,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2022-07-23 06:18:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:18:49,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:49,727 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1250) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1251) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:49,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1251) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1250) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:49,758 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1250) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1251) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:49,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965374738] [2022-07-23 06:18:49,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965374738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:49,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [898161640] [2022-07-23 06:18:49,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:18:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:18:49,782 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:18:49,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-07-23 06:18:50,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:18:50,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:18:50,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 06:18:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:50,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:50,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:18:50,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:50,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:50,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:50,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:50,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:18:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:50,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:50,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-23 06:18:50,547 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:50,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:50,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:50,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-23 06:18:50,658 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:18:50,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:18:50,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:18:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2022-07-23 06:18:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:50,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:18:51,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:51,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-23 06:18:51,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:51,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:18:51,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:51,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:51,566 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1338) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1336) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:51,579 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1338) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1336) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:51,597 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1336) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1338) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:18:51,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [898161640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:51,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:51,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2022-07-23 06:18:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809510946] [2022-07-23 06:18:51,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:51,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:18:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:18:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=511, Unknown=6, NotChecked=306, Total=930 [2022-07-23 06:18:51,621 INFO L87 Difference]: Start difference. First operand 310 states and 354 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:52,827 INFO L93 Difference]: Finished difference Result 345 states and 393 transitions. [2022-07-23 06:18:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:18:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-23 06:18:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:52,829 INFO L225 Difference]: With dead ends: 345 [2022-07-23 06:18:52,829 INFO L226 Difference]: Without dead ends: 345 [2022-07-23 06:18:52,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=185, Invalid=763, Unknown=6, NotChecked=378, Total=1332 [2022-07-23 06:18:52,830 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 251 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:52,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 750 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 317 Invalid, 0 Unknown, 132 Unchecked, 0.5s Time] [2022-07-23 06:18:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-23 06:18:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2022-07-23 06:18:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 231 states have internal predecessors, (258), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (27), 21 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-23 06:18:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 312 transitions. [2022-07-23 06:18:52,834 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 312 transitions. Word has length 37 [2022-07-23 06:18:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:52,834 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 312 transitions. [2022-07-23 06:18:52,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:18:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 312 transitions. [2022-07-23 06:18:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:18:52,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:52,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:52,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-07-23 06:18:53,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:53,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:53,244 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash 318176130, now seen corresponding path program 1 times [2022-07-23 06:18:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:53,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238903173] [2022-07-23 06:18:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:53,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:53,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:53,246 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:53,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-23 06:18:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:53,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 06:18:53,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:53,396 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-23 06:18:53,428 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:18:53,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:18:53,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:53,662 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:53,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-23 06:18:53,789 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 31 treesize of output 13 [2022-07-23 06:18:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:53,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:53,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1384) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 06:18:53,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) v_ArrVal_1384) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-23 06:18:53,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238903173] [2022-07-23 06:18:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238903173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138657784] [2022-07-23 06:18:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:53,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:18:53,988 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:18:54,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-07-23 06:18:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:54,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:18:54,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:54,290 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-23 06:18:54,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:54,892 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:54,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-23 06:18:55,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 06:18:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:55,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:55,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1428) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2022-07-23 06:18:55,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1428) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 06:18:55,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) v_ArrVal_1428) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-23 06:18:55,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [138657784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:55,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:55,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-23 06:18:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166838257] [2022-07-23 06:18:55,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:55,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:18:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:55,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:18:55,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=481, Unknown=11, NotChecked=240, Total=812 [2022-07-23 06:18:55,503 INFO L87 Difference]: Start difference. First operand 273 states and 312 transitions. Second operand has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 06:18:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:56,527 INFO L93 Difference]: Finished difference Result 324 states and 370 transitions. [2022-07-23 06:18:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:18:56,528 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-23 06:18:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:56,529 INFO L225 Difference]: With dead ends: 324 [2022-07-23 06:18:56,529 INFO L226 Difference]: Without dead ends: 324 [2022-07-23 06:18:56,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=155, Invalid=976, Unknown=11, NotChecked=340, Total=1482 [2022-07-23 06:18:56,530 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 93 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:56,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1062 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 241 Invalid, 0 Unknown, 297 Unchecked, 0.3s Time] [2022-07-23 06:18:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-23 06:18:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 307. [2022-07-23 06:18:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.2320675105485233) internal successors, (292), 261 states have internal predecessors, (292), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 23 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-23 06:18:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 350 transitions. [2022-07-23 06:18:56,535 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 350 transitions. Word has length 40 [2022-07-23 06:18:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:56,535 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 350 transitions. [2022-07-23 06:18:56,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 06:18:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 350 transitions. [2022-07-23 06:18:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:18:56,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:56,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:56,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:56,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:56,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:56,944 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:18:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash 318176131, now seen corresponding path program 1 times [2022-07-23 06:18:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:18:56,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172559149] [2022-07-23 06:18:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:56,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:18:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:18:56,946 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:18:56,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-23 06:18:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:57,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:18:57,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:57,103 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-23 06:18:57,132 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-23 06:18:57,143 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:57,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:57,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:57,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:57,397 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:57,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 06:18:57,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:18:57,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:57,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:18:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:57,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:57,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-23 06:18:57,822 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))) (forall ((v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-23 06:18:57,872 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))))))) is different from false [2022-07-23 06:18:57,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:18:57,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172559149] [2022-07-23 06:18:57,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172559149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:57,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2114446838] [2022-07-23 06:18:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:18:57,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:18:57,906 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:18:57,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-07-23 06:18:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:58,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:18:58,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:58,260 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-23 06:18:58,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:58,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:58,968 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:58,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-07-23 06:18:58,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:18:58,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:18:59,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:18:59,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 06:18:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:59,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:59,729 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1522) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))) is different from false [2022-07-23 06:18:59,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1522) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2)))))) is different from false [2022-07-23 06:18:59,809 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-23 06:18:59,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2114446838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:59,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:18:59,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-23 06:18:59,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914251954] [2022-07-23 06:18:59,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:59,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:18:59,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:18:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:18:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=434, Unknown=6, NotChecked=282, Total=812 [2022-07-23 06:18:59,842 INFO L87 Difference]: Start difference. First operand 307 states and 350 transitions. Second operand has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 06:19:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:00,253 INFO L93 Difference]: Finished difference Result 324 states and 369 transitions. [2022-07-23 06:19:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:19:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-23 06:19:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:00,254 INFO L225 Difference]: With dead ends: 324 [2022-07-23 06:19:00,254 INFO L226 Difference]: Without dead ends: 324 [2022-07-23 06:19:00,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=557, Unknown=6, NotChecked=318, Total=992 [2022-07-23 06:19:00,255 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 82 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:00,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 964 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 206 Invalid, 0 Unknown, 311 Unchecked, 0.3s Time] [2022-07-23 06:19:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-23 06:19:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 307. [2022-07-23 06:19:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.2278481012658229) internal successors, (291), 261 states have internal predecessors, (291), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 23 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-23 06:19:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 349 transitions. [2022-07-23 06:19:00,262 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 349 transitions. Word has length 40 [2022-07-23 06:19:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:00,262 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 349 transitions. [2022-07-23 06:19:00,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 06:19:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 349 transitions. [2022-07-23 06:19:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:19:00,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:00,263 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:00,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:00,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:00,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:00,676 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1343891098, now seen corresponding path program 1 times [2022-07-23 06:19:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042614290] [2022-07-23 06:19:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:00,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:00,678 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:00,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-23 06:19:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:00,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:19:00,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:00,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 06:19:00,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 06:19:00,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 06:19:00,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 06:19:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:19:00,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:19:00,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:00,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042614290] [2022-07-23 06:19:00,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042614290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:00,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:00,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:19:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303376614] [2022-07-23 06:19:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:00,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:19:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:19:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:19:00,888 INFO L87 Difference]: Start difference. First operand 307 states and 349 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 06:19:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:00,890 INFO L93 Difference]: Finished difference Result 314 states and 357 transitions. [2022-07-23 06:19:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:19:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-23 06:19:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:00,891 INFO L225 Difference]: With dead ends: 314 [2022-07-23 06:19:00,891 INFO L226 Difference]: Without dead ends: 285 [2022-07-23 06:19:00,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:19:00,892 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:00,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-07-23 06:19:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-23 06:19:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-07-23 06:19:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 219 states have (on average 1.2420091324200913) internal successors, (272), 243 states have internal predecessors, (272), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (27), 21 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-23 06:19:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2022-07-23 06:19:00,897 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 43 [2022-07-23 06:19:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:00,897 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2022-07-23 06:19:00,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 06:19:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2022-07-23 06:19:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:19:00,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:00,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:00,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Ended with exit code 0 [2022-07-23 06:19:01,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:01,106 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash -982902293, now seen corresponding path program 1 times [2022-07-23 06:19:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:01,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31103175] [2022-07-23 06:19:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:01,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:01,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:01,108 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:01,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-23 06:19:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:01,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:19:01,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:19:01,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:01,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31103175] [2022-07-23 06:19:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31103175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:19:01,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:19:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-07-23 06:19:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088121350] [2022-07-23 06:19:01,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:01,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:19:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:19:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:19:01,566 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:19:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:01,878 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-23 06:19:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:19:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2022-07-23 06:19:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:01,880 INFO L225 Difference]: With dead ends: 283 [2022-07-23 06:19:01,880 INFO L226 Difference]: Without dead ends: 283 [2022-07-23 06:19:01,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:19:01,881 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:01,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 501 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:19:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-23 06:19:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 274. [2022-07-23 06:19:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 213 states have (on average 1.2347417840375587) internal successors, (263), 234 states have internal predecessors, (263), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:19:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2022-07-23 06:19:01,887 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 42 [2022-07-23 06:19:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:01,887 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2022-07-23 06:19:01,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-23 06:19:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2022-07-23 06:19:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:19:01,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:01,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:01,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Ended with exit code 0 [2022-07-23 06:19:02,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:02,097 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash 578980905, now seen corresponding path program 2 times [2022-07-23 06:19:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:02,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191305400] [2022-07-23 06:19:02,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:19:02,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:02,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:02,108 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:02,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-23 06:19:02,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:19:02,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:19:02,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:19:02,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:02,330 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-23 06:19:02,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:02,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:02,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:19:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:19:02,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:02,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-23 06:19:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 06:19:03,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191305400] [2022-07-23 06:19:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191305400] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:19:03,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:19:03,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-07-23 06:19:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213106004] [2022-07-23 06:19:03,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:03,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:19:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:19:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:19:03,072 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-23 06:19:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:04,150 INFO L93 Difference]: Finished difference Result 321 states and 366 transitions. [2022-07-23 06:19:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:19:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-07-23 06:19:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:04,151 INFO L225 Difference]: With dead ends: 321 [2022-07-23 06:19:04,151 INFO L226 Difference]: Without dead ends: 321 [2022-07-23 06:19:04,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:19:04,152 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 204 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:04,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 730 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 430 Invalid, 0 Unknown, 346 Unchecked, 0.7s Time] [2022-07-23 06:19:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-23 06:19:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-07-23 06:19:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 233 states have internal predecessors, (262), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:19:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 310 transitions. [2022-07-23 06:19:04,156 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 310 transitions. Word has length 42 [2022-07-23 06:19:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:04,157 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 310 transitions. [2022-07-23 06:19:04,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-23 06:19:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 310 transitions. [2022-07-23 06:19:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:19:04,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:04,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:04,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:04,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:04,366 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash 578980906, now seen corresponding path program 1 times [2022-07-23 06:19:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:04,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053044539] [2022-07-23 06:19:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:04,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:04,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:04,368 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:04,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-07-23 06:19:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:04,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:19:04,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:04,617 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-23 06:19:04,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:04,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:04,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:19:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:05,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:05,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053044539] [2022-07-23 06:19:05,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053044539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:05,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1544919098] [2022-07-23 06:19:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:05,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:19:05,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:19:05,389 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:19:05,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2022-07-23 06:19:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:05,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 06:19:05,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:05,829 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-23 06:19:05,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:06,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:06,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-07-23 06:19:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:06,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:06,900 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 40 treesize of output 34 [2022-07-23 06:19:07,080 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 28 [2022-07-23 06:19:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:07,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1544919098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:19:07,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:19:07,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2022-07-23 06:19:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460747193] [2022-07-23 06:19:07,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:07,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 06:19:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 06:19:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 06:19:07,389 INFO L87 Difference]: Start difference. First operand 273 states and 310 transitions. Second operand has 38 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 36 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:19:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:09,381 INFO L93 Difference]: Finished difference Result 326 states and 378 transitions. [2022-07-23 06:19:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 06:19:09,382 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 36 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-23 06:19:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:09,383 INFO L225 Difference]: With dead ends: 326 [2022-07-23 06:19:09,383 INFO L226 Difference]: Without dead ends: 326 [2022-07-23 06:19:09,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-07-23 06:19:09,384 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 198 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:09,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 992 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 992 Invalid, 0 Unknown, 229 Unchecked, 1.7s Time] [2022-07-23 06:19:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-23 06:19:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 269. [2022-07-23 06:19:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 213 states have (on average 1.2112676056338028) internal successors, (258), 229 states have internal predecessors, (258), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:19:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2022-07-23 06:19:09,389 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 42 [2022-07-23 06:19:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:09,389 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2022-07-23 06:19:09,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 36 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:19:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2022-07-23 06:19:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:19:09,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:09,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:09,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:09,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Ended with exit code 0 [2022-07-23 06:19:09,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:09,801 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1984961000, now seen corresponding path program 1 times [2022-07-23 06:19:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:09,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296986659] [2022-07-23 06:19:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:09,803 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:09,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-07-23 06:19:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:09,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:19:09,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:10,000 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-23 06:19:10,027 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:19:10,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:19:10,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:12,077 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47|)) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) is different from true [2022-07-23 06:19:12,201 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:12,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 36 [2022-07-23 06:19:12,205 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 12 treesize of output 11 [2022-07-23 06:19:12,477 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:12,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-23 06:19:12,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:19:12,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:19:12,503 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:19:12,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2022-07-23 06:19:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:12,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:12,568 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1857) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1858) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:19:12,578 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1858) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|))) (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1857) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:19:12,599 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1857) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1858) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:19:12,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296986659] [2022-07-23 06:19:12,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296986659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1636176796] [2022-07-23 06:19:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:19:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:19:12,610 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:19:12,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-07-23 06:19:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:12,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-23 06:19:12,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:13,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:13,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:15,194 WARN L855 $PredicateComparison]: unable to prove that (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (bvult (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (_ bv4 32)) |#StackHeapBarrier|))) is different from true [2022-07-23 06:19:15,486 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:15,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2022-07-23 06:19:15,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 06:19:16,253 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:16,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-23 06:19:16,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:16,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:19:16,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:19:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:16,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:16,360 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1911) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1912) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:19:16,369 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1912) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1911) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:19:16,386 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1911) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1912) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-23 06:19:16,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1636176796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:16,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:19:16,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-07-23 06:19:16,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066934883] [2022-07-23 06:19:16,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:16,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-23 06:19:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:16,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-23 06:19:16,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=618, Unknown=8, NotChecked=456, Total=1190 [2022-07-23 06:19:16,395 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:19:18,543 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47|)) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (bvult (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (_ bv4 32)) |#StackHeapBarrier|)))) is different from true [2022-07-23 06:19:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:18,624 INFO L93 Difference]: Finished difference Result 275 states and 312 transitions. [2022-07-23 06:19:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:19:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2022-07-23 06:19:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:18,625 INFO L225 Difference]: With dead ends: 275 [2022-07-23 06:19:18,626 INFO L226 Difference]: Without dead ends: 275 [2022-07-23 06:19:18,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=131, Invalid=766, Unknown=9, NotChecked=576, Total=1482 [2022-07-23 06:19:18,626 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:18,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 883 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 302 Unchecked, 0.1s Time] [2022-07-23 06:19:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-23 06:19:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2022-07-23 06:19:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2102803738317758) internal successors, (259), 230 states have internal predecessors, (259), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:19:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 307 transitions. [2022-07-23 06:19:18,630 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 307 transitions. Word has length 45 [2022-07-23 06:19:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:18,630 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 307 transitions. [2022-07-23 06:19:18,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:19:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 307 transitions. [2022-07-23 06:19:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:19:18,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:18,631 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:18,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:18,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:19,044 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -950221421, now seen corresponding path program 2 times [2022-07-23 06:19:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608703210] [2022-07-23 06:19:19,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:19:19,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:19,045 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:19,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-07-23 06:19:19,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:19:19,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:19:19,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:19:19,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:19,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:19,358 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-07-23 06:19:19,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2022-07-23 06:19:19,377 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:19:19,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-23 06:19:19,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:19,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:19,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 100 [2022-07-23 06:19:20,163 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-23 06:19:20,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 33 [2022-07-23 06:19:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:19:20,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:19:20,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:20,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608703210] [2022-07-23 06:19:20,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608703210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:20,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:20,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 06:19:20,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276586950] [2022-07-23 06:19:20,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:20,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 06:19:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:20,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 06:19:20,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:19:20,185 INFO L87 Difference]: Start difference. First operand 270 states and 307 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:19:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:20,530 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2022-07-23 06:19:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:19:20,530 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-23 06:19:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:20,532 INFO L225 Difference]: With dead ends: 271 [2022-07-23 06:19:20,532 INFO L226 Difference]: Without dead ends: 271 [2022-07-23 06:19:20,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-07-23 06:19:20,532 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:20,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 546 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 206 Unchecked, 0.2s Time] [2022-07-23 06:19:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-23 06:19:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2022-07-23 06:19:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.205607476635514) internal successors, (258), 230 states have internal predecessors, (258), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:19:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2022-07-23 06:19:20,536 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 46 [2022-07-23 06:19:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:20,537 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2022-07-23 06:19:20,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:19:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2022-07-23 06:19:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:19:20,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:20,538 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:20,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Ended with exit code 0 [2022-07-23 06:19:20,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:20,744 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash -950221420, now seen corresponding path program 2 times [2022-07-23 06:19:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:20,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164921938] [2022-07-23 06:19:20,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:19:20,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:20,745 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:20,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-07-23 06:19:20,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:19:20,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:19:20,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:19:20,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:21,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:21,091 INFO L356 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-07-23 06:19:21,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 83 [2022-07-23 06:19:21,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:21,128 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-07-23 06:19:21,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 79 [2022-07-23 06:19:22,297 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-23 06:19:22,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 52 [2022-07-23 06:19:22,313 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:19:22,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 43 [2022-07-23 06:19:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 06:19:22,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:19:22,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:19:22,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164921938] [2022-07-23 06:19:22,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164921938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:22,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:22,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 06:19:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066921203] [2022-07-23 06:19:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 06:19:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:19:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 06:19:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:19:22,364 INFO L87 Difference]: Start difference. First operand 270 states and 306 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:19:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:23,908 INFO L93 Difference]: Finished difference Result 275 states and 307 transitions. [2022-07-23 06:19:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:19:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-23 06:19:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:23,910 INFO L225 Difference]: With dead ends: 275 [2022-07-23 06:19:23,910 INFO L226 Difference]: Without dead ends: 275 [2022-07-23 06:19:23,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-07-23 06:19:23,910 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 101 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:23,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 526 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 51 Unchecked, 0.6s Time] [2022-07-23 06:19:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-23 06:19:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2022-07-23 06:19:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2009345794392523) internal successors, (257), 230 states have internal predecessors, (257), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-23 06:19:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2022-07-23 06:19:23,914 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 46 [2022-07-23 06:19:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:23,914 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2022-07-23 06:19:23,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:19:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-07-23 06:19:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 06:19:23,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:23,915 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-23 06:19:23,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:24,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:19:24,123 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-23 06:19:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1746455468, now seen corresponding path program 1 times [2022-07-23 06:19:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:19:24,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438880622] [2022-07-23 06:19:24,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:24,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:19:24,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:19:24,125 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:19:24,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2022-07-23 06:19:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:24,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-23 06:19:24,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:24,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:24,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:24,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:19:24,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:24,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:19:24,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:19:24,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:24,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:24,982 INFO L356 Elim1Store]: treesize reduction 110, result has 22.5 percent of original size [2022-07-23 06:19:24,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 72 [2022-07-23 06:19:24,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:25,017 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-07-23 06:19:25,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2022-07-23 06:19:25,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:25,593 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:19:25,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-07-23 06:19:25,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:25,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 06:19:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:19:25,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:44,859 WARN L233 SmtUtils]: Spent 18.22s 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-23 06:20:05,667 WARN L233 SmtUtils]: Spent 18.26s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:20:30,732 WARN L233 SmtUtils]: Spent 18.28s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:20:56,572 WARN L233 SmtUtils]: Spent 18.36s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)