./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:51:02,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:51:02,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:51:02,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:51:02,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:51:02,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:51:02,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:51:02,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:51:02,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:51:02,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:51:02,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:51:02,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:51:02,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:51:02,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:51:02,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:51:02,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:51:02,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:51:02,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:51:02,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:51:02,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:51:02,667 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:51:02,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:51:02,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:51:02,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:51:02,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:51:02,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:51:02,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:51:02,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:51:02,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:51:02,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:51:02,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:51:02,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:51:02,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:51:02,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:51:02,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:51:02,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:51:02,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:51:02,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:51:02,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:51:02,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:51:02,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:51:02,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:51:02,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:51:02,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:51:02,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:51:02,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:51:02,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:51:02,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:51:02,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:51:02,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:51:02,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:51:02,708 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:51:02,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:51:02,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:51:02,709 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:51:02,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:51:02,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:51:02,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:51:02,710 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:51:02,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:51:02,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:51:02,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:51:02,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:51:02,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:51:02,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:51:02,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:51:02,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:51:02,713 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2022-07-14 06:51:02,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:51:02,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:51:02,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:51:02,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:51:02,939 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:51:02,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2022-07-14 06:51:02,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f48246f9/4eb50356ee954785ac246b7cd8b27023/FLAG217f3bf6d [2022-07-14 06:51:03,358 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:51:03,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2022-07-14 06:51:03,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f48246f9/4eb50356ee954785ac246b7cd8b27023/FLAG217f3bf6d [2022-07-14 06:51:03,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f48246f9/4eb50356ee954785ac246b7cd8b27023 [2022-07-14 06:51:03,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:51:03,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:51:03,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:51:03,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:51:03,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:51:03,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7ee77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03, skipping insertion in model container [2022-07-14 06:51:03,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:51:03,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:51:03,644 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/list-simple/dll2c_prepend_unequal.i[24729,24742] [2022-07-14 06:51:03,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:51:03,656 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:51:03,688 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/list-simple/dll2c_prepend_unequal.i[24729,24742] [2022-07-14 06:51:03,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:51:03,717 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:51:03,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03 WrapperNode [2022-07-14 06:51:03,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:51:03,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:51:03,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:51:03,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:51:03,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,790 INFO L137 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2022-07-14 06:51:03,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:51:03,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:51:03,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:51:03,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:51:03,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:51:03,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:51:03,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:51:03,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:51:03,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (1/1) ... [2022-07-14 06:51:03,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:51:03,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:03,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:51:03,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:51:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:51:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:51:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:51:03,907 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:51:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:51:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:51:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:51:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:51:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:51:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:51:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:51:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:51:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:51:03,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:51:04,010 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:51:04,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:51:04,302 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:51:04,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:51:04,310 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:51:04,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:51:04 BoogieIcfgContainer [2022-07-14 06:51:04,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:51:04,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:51:04,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:51:04,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:51:04,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:51:03" (1/3) ... [2022-07-14 06:51:04,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75130ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:51:04, skipping insertion in model container [2022-07-14 06:51:04,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:03" (2/3) ... [2022-07-14 06:51:04,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75130ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:51:04, skipping insertion in model container [2022-07-14 06:51:04,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:51:04" (3/3) ... [2022-07-14 06:51:04,321 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2022-07-14 06:51:04,347 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:51:04,348 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-14 06:51:04,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:51:04,402 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@32d98dff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b932944 [2022-07-14 06:51:04,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-14 06:51:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:51:04,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:04,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:51:04,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-07-14 06:51:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:04,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526795107] [2022-07-14 06:51:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:04,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:04,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526795107] [2022-07-14 06:51:04,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526795107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:04,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:04,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:51:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880239599] [2022-07-14 06:51:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:04,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:51:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:51:04,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:04,624 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:04,717 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-14 06:51:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:51:04,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-14 06:51:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:04,725 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:51:04,725 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:51:04,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:04,729 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:04,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:51:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:51:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-14 06:51:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-14 06:51:04,757 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-07-14 06:51:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:04,758 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-14 06:51:04,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-14 06:51:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:51:04,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:04,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:51:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:51:04,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-07-14 06:51:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:04,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183376405] [2022-07-14 06:51:04,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:04,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183376405] [2022-07-14 06:51:04,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183376405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:04,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:04,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:51:04,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572184136] [2022-07-14 06:51:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:04,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:51:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:04,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:51:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:04,806 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:04,870 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-14 06:51:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:51:04,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-14 06:51:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:04,872 INFO L225 Difference]: With dead ends: 129 [2022-07-14 06:51:04,872 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 06:51:04,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:04,873 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:04,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:51:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 06:51:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-14 06:51:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-14 06:51:04,880 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-07-14 06:51:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:04,880 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-14 06:51:04,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-14 06:51:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:51:04,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:04,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:04,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:51:04,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-07-14 06:51:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:04,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32315403] [2022-07-14 06:51:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32315403] [2022-07-14 06:51:04,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32315403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:04,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:04,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:51:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498261352] [2022-07-14 06:51:04,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:04,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:51:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:51:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:51:04,967 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 06:51:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:05,074 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-14 06:51:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:51:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-07-14 06:51:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:05,078 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:51:05,078 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:51:05,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-14 06:51:05,083 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:05,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:51:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:51:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-07-14 06:51:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-14 06:51:05,101 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-07-14 06:51:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:05,101 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-14 06:51:05,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 06:51:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-14 06:51:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:51:05,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:05,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:05,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:51:05,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-07-14 06:51:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:05,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791207342] [2022-07-14 06:51:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:51:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:05,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791207342] [2022-07-14 06:51:05,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791207342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:05,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:05,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:51:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469779805] [2022-07-14 06:51:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:51:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:51:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:51:05,222 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:05,427 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-14 06:51:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-14 06:51:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:05,430 INFO L225 Difference]: With dead ends: 130 [2022-07-14 06:51:05,430 INFO L226 Difference]: Without dead ends: 130 [2022-07-14 06:51:05,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:51:05,435 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:05,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-14 06:51:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-14 06:51:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-14 06:51:05,451 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-07-14 06:51:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:05,452 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-14 06:51:05,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-14 06:51:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:51:05,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:05,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:05,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:51:05,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:05,454 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-07-14 06:51:05,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:05,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751995180] [2022-07-14 06:51:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:05,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751995180] [2022-07-14 06:51:05,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751995180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:05,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:05,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:51:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334690675] [2022-07-14 06:51:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:51:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:51:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:51:05,597 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:05,778 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-14 06:51:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-14 06:51:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:05,781 INFO L225 Difference]: With dead ends: 129 [2022-07-14 06:51:05,781 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 06:51:05,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:51:05,782 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 06:51:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-14 06:51:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-07-14 06:51:05,786 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-07-14 06:51:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:05,786 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-07-14 06:51:05,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-07-14 06:51:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:51:05,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:05,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:05,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:51:05,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-07-14 06:51:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:05,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008439376] [2022-07-14 06:51:05,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:05,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008439376] [2022-07-14 06:51:05,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008439376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:05,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530073625] [2022-07-14 06:51:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:05,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:05,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:51:05,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:51:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:05,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:51:05,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:06,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:06,146 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:51:06,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:51:06,155 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-14 06:51:06,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:06,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530073625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:06,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:06,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-14 06:51:06,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125872658] [2022-07-14 06:51:06,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:51:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:06,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:51:06,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:51:06,200 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:06,465 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2022-07-14 06:51:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-07-14 06:51:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:06,466 INFO L225 Difference]: With dead ends: 153 [2022-07-14 06:51:06,466 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:51:06,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:51:06,467 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:06,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 404 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 453 Invalid, 0 Unknown, 4 Unchecked, 0.2s Time] [2022-07-14 06:51:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:51:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2022-07-14 06:51:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-14 06:51:06,471 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-07-14 06:51:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:06,471 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-14 06:51:06,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-14 06:51:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:51:06,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:06,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:06,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 06:51:06,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-14 06:51:06,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-07-14 06:51:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:06,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953608899] [2022-07-14 06:51:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:06,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:06,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:06,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953608899] [2022-07-14 06:51:06,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953608899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:06,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351259493] [2022-07-14 06:51:06,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:06,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:06,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:06,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:51:06,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:51:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:06,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:51:06,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:06,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:07,178 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:51:07,178 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 14 treesize of output 20 [2022-07-14 06:51:07,194 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:51:07,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:51:07,236 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-14 06:51:07,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:07,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351259493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:07,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:07,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-14 06:51:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209378757] [2022-07-14 06:51:07,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:07,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 06:51:07,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:07,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 06:51:07,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:51:07,354 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:51:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:07,962 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-14 06:51:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:51:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-07-14 06:51:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:07,964 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:51:07,964 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:51:07,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:51:07,965 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:07,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 986 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 828 Invalid, 0 Unknown, 166 Unchecked, 0.5s Time] [2022-07-14 06:51:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:51:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-14 06:51:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-14 06:51:07,969 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-07-14 06:51:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:07,970 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-14 06:51:07,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:51:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-14 06:51:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:51:07,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:07,971 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-14 06:51:08,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:08,172 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,SelfDestructingSolverStorable6 [2022-07-14 06:51:08,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-07-14 06:51:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:08,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745767576] [2022-07-14 06:51:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:08,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:08,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745767576] [2022-07-14 06:51:08,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745767576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:08,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291650961] [2022-07-14 06:51:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:08,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:08,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:08,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:51:08,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:51:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:51:08,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:08,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:08,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291650961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:08,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:51:08,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-14 06:51:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778956180] [2022-07-14 06:51:08,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:08,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:51:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:51:08,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:51:08,509 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:51:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:08,630 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-14 06:51:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-07-14 06:51:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:08,632 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:51:08,632 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:51:08,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:51:08,633 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:08,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:51:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:51:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-14 06:51:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-14 06:51:08,638 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-07-14 06:51:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:08,638 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-14 06:51:08,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:51:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-14 06:51:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:51:08,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:08,640 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] [2022-07-14 06:51:08,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:08,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:08,847 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-07-14 06:51:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951125520] [2022-07-14 06:51:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:08,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:08,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951125520] [2022-07-14 06:51:08,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951125520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:08,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814161161] [2022-07-14 06:51:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:08,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:08,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:08,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:51:08,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:51:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:09,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:51:09,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:09,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:09,059 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:51:09,060 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-14 06:51:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814161161] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:09,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:51:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-14 06:51:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236759991] [2022-07-14 06:51:09,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:51:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:09,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:51:09,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:09,075 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:09,206 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-07-14 06:51:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:09,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-07-14 06:51:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:09,224 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:51:09,224 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 06:51:09,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:51:09,225 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 13 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:09,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 311 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:51:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 06:51:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-14 06:51:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-14 06:51:09,227 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-07-14 06:51:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:09,228 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-14 06:51:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-14 06:51:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:51:09,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:09,228 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] [2022-07-14 06:51:09,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:09,435 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-07-14 06:51:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:09,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022178971] [2022-07-14 06:51:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:09,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:09,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022178971] [2022-07-14 06:51:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022178971] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:09,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15411825] [2022-07-14 06:51:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:09,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:09,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:09,530 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-14 06:51:09,561 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-14 06:51:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:09,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:51:09,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:09,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:09,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:51:09,735 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 20 treesize of output 24 [2022-07-14 06:51:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15411825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:09,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:51:09,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-14 06:51:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693942839] [2022-07-14 06:51:09,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:09,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:51:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:51:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:51:09,819 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 06:51:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:10,083 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-14 06:51:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:51:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-07-14 06:51:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:10,084 INFO L225 Difference]: With dead ends: 143 [2022-07-14 06:51:10,084 INFO L226 Difference]: Without dead ends: 143 [2022-07-14 06:51:10,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:51:10,085 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:10,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1352 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-14 06:51:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-14 06:51:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-14 06:51:10,088 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-07-14 06:51:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:10,089 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-14 06:51:10,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 06:51:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-14 06:51:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:51:10,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:10,089 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] [2022-07-14 06:51:10,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:10,290 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,SelfDestructingSolverStorable9 [2022-07-14 06:51:10,290 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-07-14 06:51:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:10,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285480551] [2022-07-14 06:51:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:51:10,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:10,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285480551] [2022-07-14 06:51:10,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285480551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:10,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:10,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:51:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740681785] [2022-07-14 06:51:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:10,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:51:10,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:51:10,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:51:10,364 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:10,560 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-14 06:51:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:51:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:51:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:10,561 INFO L225 Difference]: With dead ends: 136 [2022-07-14 06:51:10,561 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 06:51:10,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:51:10,562 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 23 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:10,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 475 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 06:51:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-14 06:51:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-14 06:51:10,565 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-07-14 06:51:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:10,565 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-14 06:51:10,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-14 06:51:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:51:10,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:10,566 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] [2022-07-14 06:51:10,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:51:10,566 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-07-14 06:51:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:10,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689854179] [2022-07-14 06:51:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:10,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689854179] [2022-07-14 06:51:10,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689854179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:10,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:10,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:51:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046432620] [2022-07-14 06:51:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:10,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:51:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:51:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:51:10,642 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:10,838 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-14 06:51:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:51:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:51:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:10,839 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:51:10,839 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:51:10,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:51:10,840 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:10,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:51:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-14 06:51:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-14 06:51:10,842 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-07-14 06:51:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:10,842 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-14 06:51:10,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-14 06:51:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:51:10,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:10,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:10,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:51:10,844 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-07-14 06:51:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:10,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608860206] [2022-07-14 06:51:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 06:51:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 06:51:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608860206] [2022-07-14 06:51:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608860206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140247126] [2022-07-14 06:51:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:10,914 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-14 06:51:10,915 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-14 06:51:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:11,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:51:11,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:11,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:11,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140247126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:11,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:51:11,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-14 06:51:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468001544] [2022-07-14 06:51:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:11,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:51:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:51:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:51:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:11,086 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:11,094 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-14 06:51:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:51:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-14 06:51:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:11,095 INFO L225 Difference]: With dead ends: 122 [2022-07-14 06:51:11,095 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:51:11,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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-14 06:51:11,096 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:11,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 153 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:51:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:51:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-14 06:51:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-07-14 06:51:11,099 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-07-14 06:51:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:11,099 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-07-14 06:51:11,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-07-14 06:51:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:51:11,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:11,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:11,117 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-14 06:51:11,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:11,306 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-07-14 06:51:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:51:11,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150952896] [2022-07-14 06:51:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:51:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:51:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:51:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 06:51:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 06:51:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:51:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150952896] [2022-07-14 06:51:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150952896] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837577358] [2022-07-14 06:51:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:11,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:11,504 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-14 06:51:11,505 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-14 06:51:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:11,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 06:51:11,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:11,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:11,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:11,796 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:51:11,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:11,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:51:11,998 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 91873 column 46: unknown constant v_#valid_BEFORE_CALL_6 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) 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) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) 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.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) 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) [2022-07-14 06:51:12,001 INFO L158 Benchmark]: Toolchain (without parser) took 8621.58ms. Allocated memory was 104.9MB in the beginning and 209.7MB in the end (delta: 104.9MB). Free memory was 75.8MB in the beginning and 92.9MB in the end (delta: -17.1MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2022-07-14 06:51:12,001 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:51:12,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.42ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 75.8MB in the beginning and 104.8MB in the end (delta: -29.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 06:51:12,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.73ms. Allocated memory is still 138.4MB. Free memory was 104.8MB in the beginning and 102.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:51:12,002 INFO L158 Benchmark]: Boogie Preprocessor took 49.05ms. Allocated memory is still 138.4MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:51:12,002 INFO L158 Benchmark]: RCFGBuilder took 471.39ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 78.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-14 06:51:12,002 INFO L158 Benchmark]: TraceAbstraction took 7686.48ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 77.7MB in the beginning and 92.9MB in the end (delta: -15.1MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2022-07-14 06:51:12,004 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 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.42ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 75.8MB in the beginning and 104.8MB in the end (delta: -29.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.73ms. Allocated memory is still 138.4MB. Free memory was 104.8MB in the beginning and 102.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.05ms. Allocated memory is still 138.4MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.39ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 78.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7686.48ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 77.7MB in the beginning and 92.9MB in the end (delta: -15.1MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 91873 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 91873 column 46: unknown constant v_#valid_BEFORE_CALL_6: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:51:12,018 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 1 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/list-simple/dll2c_prepend_unequal.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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:51:13,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:51:13,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:51:13,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:51:13,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:51:13,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:51:13,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:51:13,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:51:13,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:51:13,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:51:13,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:51:13,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:51:13,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:51:13,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:51:13,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:51:13,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:51:13,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:51:13,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:51:13,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:51:13,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:51:13,877 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:51:13,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:51:13,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:51:13,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:51:13,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:51:13,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:51:13,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:51:13,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:51:13,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:51:13,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:51:13,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:51:13,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:51:13,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:51:13,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:51:13,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:51:13,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:51:13,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:51:13,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:51:13,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:51:13,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:51:13,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:51:13,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:51:13,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:51:13,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:51:13,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:51:13,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:51:13,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:51:13,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:51:13,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:51:13,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:51:13,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:51:13,928 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:51:13,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:51:13,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:51:13,929 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:51:13,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:51:13,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:51:13,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:51:13,930 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:51:13,930 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:51:13,930 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:51:13,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:51:13,931 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:51:13,931 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:51:13,931 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:51:13,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:51:13,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:51:13,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:51:13,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:51:13,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:51:13,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:51:13,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:51:13,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:51:13,933 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:51:13,933 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:51:13,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:51:13,933 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2022-07-14 06:51:14,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:51:14,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:51:14,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:51:14,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:51:14,245 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:51:14,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2022-07-14 06:51:14,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd26cef35/a5b7b53cd82c424cb34147b4d075a7b9/FLAG2560abb5f [2022-07-14 06:51:14,716 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:51:14,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2022-07-14 06:51:14,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd26cef35/a5b7b53cd82c424cb34147b4d075a7b9/FLAG2560abb5f [2022-07-14 06:51:15,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd26cef35/a5b7b53cd82c424cb34147b4d075a7b9 [2022-07-14 06:51:15,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:51:15,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:51:15,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:51:15,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:51:15,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:51:15,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec0c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15, skipping insertion in model container [2022-07-14 06:51:15,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:51:15,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:51:15,416 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/list-simple/dll2c_prepend_unequal.i[24729,24742] [2022-07-14 06:51:15,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:51:15,440 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:51:15,494 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/list-simple/dll2c_prepend_unequal.i[24729,24742] [2022-07-14 06:51:15,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:51:15,518 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:51:15,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15 WrapperNode [2022-07-14 06:51:15,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:51:15,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:51:15,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:51:15,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:51:15,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,570 INFO L137 Inliner]: procedures = 130, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 150 [2022-07-14 06:51:15,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:51:15,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:51:15,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:51:15,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:51:15,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:51:15,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:51:15,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:51:15,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:51:15,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (1/1) ... [2022-07-14 06:51:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:51:15,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:51:15,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:51:15,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:51:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:51:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:51:15,667 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:51:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:51:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:51:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:51:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:51:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:51:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:51:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:51:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:51:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:51:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:51:15,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:51:15,775 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:51:15,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:51:16,239 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:51:16,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:51:16,244 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:51:16,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:51:16 BoogieIcfgContainer [2022-07-14 06:51:16,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:51:16,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:51:16,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:51:16,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:51:16,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:51:15" (1/3) ... [2022-07-14 06:51:16,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721b6a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:51:16, skipping insertion in model container [2022-07-14 06:51:16,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:51:15" (2/3) ... [2022-07-14 06:51:16,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721b6a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:51:16, skipping insertion in model container [2022-07-14 06:51:16,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:51:16" (3/3) ... [2022-07-14 06:51:16,252 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2022-07-14 06:51:16,261 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:51:16,261 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-14 06:51:16,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:51:16,295 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@728ade17, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25158b24 [2022-07-14 06:51:16,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-14 06:51:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:51:16,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:16,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:51:16,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-07-14 06:51:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421954389] [2022-07-14 06:51:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:16,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:16,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:16,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:51:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:16,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:51:16,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:16,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:16,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:16,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:16,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421954389] [2022-07-14 06:51:16,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421954389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:16,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:16,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:51:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262360834] [2022-07-14 06:51:16,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:16,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:51:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:51:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:16,547 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:16,731 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-14 06:51:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:51:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-14 06:51:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:16,738 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:51:16,738 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:51:16,740 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-14 06:51:16,744 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:16,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:51:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-14 06:51:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-14 06:51:16,800 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-07-14 06:51:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:16,800 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-14 06:51:16,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-14 06:51:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:51:16,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:16,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:51:16,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:17,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:17,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-07-14 06:51:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:17,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032888019] [2022-07-14 06:51:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:17,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:17,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:51:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:17,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:51:17,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:17,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:17,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:17,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:17,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032888019] [2022-07-14 06:51:17,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032888019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:17,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:17,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:51:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797004542] [2022-07-14 06:51:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:51:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:51:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:17,078 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:17,268 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-14 06:51:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:51:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-14 06:51:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:17,270 INFO L225 Difference]: With dead ends: 129 [2022-07-14 06:51:17,270 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 06:51:17,270 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-14 06:51:17,271 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:17,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 06:51:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-14 06:51:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-14 06:51:17,281 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-07-14 06:51:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:17,282 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-14 06:51:17,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 06:51:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-14 06:51:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:51:17,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:17,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:17,289 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-14 06:51:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:17,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-07-14 06:51:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525311465] [2022-07-14 06:51:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:17,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:17,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:17,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:17,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:51:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:17,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:51:17,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:17,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:17,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:17,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525311465] [2022-07-14 06:51:17,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525311465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:17,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:17,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:51:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677131771] [2022-07-14 06:51:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:51:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:17,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:51:17,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:17,566 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 06:51:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:17,574 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-14 06:51:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:51:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-07-14 06:51:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:17,576 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:51:17,576 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:51:17,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:51:17,577 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:17,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 269 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:51:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:51:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-07-14 06:51:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-14 06:51:17,583 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-07-14 06:51:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:17,584 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-14 06:51:17,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 06:51:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-14 06:51:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:51:17,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:17,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:17,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:17,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:17,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-07-14 06:51:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:17,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24000321] [2022-07-14 06:51:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:17,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:17,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:51:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:17,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:51:17,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:17,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:17,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:17,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:17,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24000321] [2022-07-14 06:51:17,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24000321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:17,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:17,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:51:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951116730] [2022-07-14 06:51:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:17,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:51:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:17,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:51:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:17,922 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:18,268 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-14 06:51:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:51:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-14 06:51:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:18,271 INFO L225 Difference]: With dead ends: 130 [2022-07-14 06:51:18,271 INFO L226 Difference]: Without dead ends: 130 [2022-07-14 06:51:18,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-14 06:51:18,272 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 20 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:18,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 386 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:51:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-14 06:51:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-14 06:51:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-14 06:51:18,276 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-07-14 06:51:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:18,277 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-14 06:51:18,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-14 06:51:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:51:18,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:18,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:18,299 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-14 06:51:18,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:18,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-07-14 06:51:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:18,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252681298] [2022-07-14 06:51:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:18,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:18,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:18,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:18,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:51:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:18,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:51:18,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:18,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:18,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:18,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:18,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252681298] [2022-07-14 06:51:18,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252681298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:18,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:18,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:51:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955287827] [2022-07-14 06:51:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:18,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:51:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:18,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:51:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:18,642 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:19,144 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-14 06:51:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:51:19,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-14 06:51:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:19,146 INFO L225 Difference]: With dead ends: 129 [2022-07-14 06:51:19,146 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 06:51:19,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-14 06:51:19,147 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:19,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 410 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:51:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 06:51:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-14 06:51:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-07-14 06:51:19,154 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-07-14 06:51:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:19,155 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-07-14 06:51:19,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-07-14 06:51:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:51:19,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:19,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:19,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:19,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:19,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-07-14 06:51:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:19,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868775587] [2022-07-14 06:51:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:19,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:19,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:51:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:51:19,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:19,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:19,647 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:51:19,647 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 18 treesize of output 25 [2022-07-14 06:51:19,660 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-14 06:51:19,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:21,886 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-14 06:51:21,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868775587] [2022-07-14 06:51:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868775587] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:21,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:21,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-14 06:51:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495830807] [2022-07-14 06:51:21,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:51:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:51:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2022-07-14 06:51:21,888 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:22,285 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-14 06:51:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-07-14 06:51:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:22,286 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:51:22,286 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:51:22,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2022-07-14 06:51:22,287 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:22,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 496 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 86 Unchecked, 0.4s Time] [2022-07-14 06:51:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:51:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-14 06:51:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-14 06:51:22,290 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-07-14 06:51:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:22,291 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-14 06:51:22,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:51:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-14 06:51:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:51:22,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:22,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:22,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:22,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-07-14 06:51:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:22,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899831221] [2022-07-14 06:51:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:22,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:22,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:22,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:51:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:22,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:51:22,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:22,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-14 06:51:22,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:24,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:24,812 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:51:24,812 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 12 [2022-07-14 06:51:24,848 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-14 06:51:24,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:27,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899831221] [2022-07-14 06:51:27,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899831221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [661832943] [2022-07-14 06:51:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:27,126 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:51:27,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:51:27,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:51:27,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-14 06:51:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:27,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:51:27,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:27,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:27,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:27,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:27,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:27,482 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:51:27,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:51:27,505 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-14 06:51:27,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:29,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [661832943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:29,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:29,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-14 06:51:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785937228] [2022-07-14 06:51:29,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:29,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:51:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:29,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:51:29,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=85, Unknown=2, NotChecked=0, Total=110 [2022-07-14 06:51:29,741 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-14 06:51:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:30,579 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-14 06:51:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:51:30,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2022-07-14 06:51:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:30,580 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:51:30,580 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:51:30,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2022-07-14 06:51:30,581 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 3 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:30,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 436 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 411 Invalid, 0 Unknown, 83 Unchecked, 0.8s Time] [2022-07-14 06:51:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:51:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-14 06:51:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-14 06:51:30,585 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-07-14 06:51:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:30,585 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-14 06:51:30,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-14 06:51:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-14 06:51:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:51:30,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:30,586 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-14 06:51:30,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-14 06:51:30,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:30,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:30,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-07-14 06:51:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:30,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444542780] [2022-07-14 06:51:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:30,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:30,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:30,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:30,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:51:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:31,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:51:31,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:31,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:31,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:31,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444542780] [2022-07-14 06:51:31,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444542780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:31,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:31,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-14 06:51:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523687309] [2022-07-14 06:51:31,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:31,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:51:31,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:31,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:51:31,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:31,191 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 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-14 06:51:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:31,326 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-14 06:51:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:51:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 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 28 [2022-07-14 06:51:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:31,328 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:51:31,328 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:51:31,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 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-14 06:51:31,328 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:31,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 620 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:51:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:51:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-14 06:51:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-14 06:51:31,332 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-07-14 06:51:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:31,332 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-14 06:51:31,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 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-14 06:51:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-14 06:51:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:51:31,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:31,332 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] [2022-07-14 06:51:31,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:31,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:31,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-07-14 06:51:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:31,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829745493] [2022-07-14 06:51:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:31,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:31,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:31,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:51:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:31,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:51:31,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:31,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:31,697 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:51:31,697 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-14 06:51:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:31,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:31,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829745493] [2022-07-14 06:51:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829745493] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:31,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-14 06:51:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988111922] [2022-07-14 06:51:31,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:31,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:51:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:51:31,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:51:31,719 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-14 06:51:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:31,916 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-07-14 06:51:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:51:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 29 [2022-07-14 06:51:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:31,917 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:51:31,917 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 06:51:31,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:51:31,918 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:31,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 320 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:51:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 06:51:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-14 06:51:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-14 06:51:31,921 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-07-14 06:51:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:31,921 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-14 06:51:31,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-14 06:51:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-14 06:51:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:51:31,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:31,922 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] [2022-07-14 06:51:31,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:32,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:32,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-07-14 06:51:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:32,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788998630] [2022-07-14 06:51:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:32,131 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:32,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:51:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:32,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:51:32,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:32,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:32,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:51:32,367 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 26 [2022-07-14 06:51:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:32,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:32,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788998630] [2022-07-14 06:51:32,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788998630] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:32,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:32,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-14 06:51:32,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290004908] [2022-07-14 06:51:32,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:32,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:51:32,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:32,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:51:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:51:32,757 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:51:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:33,415 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-14 06:51:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:51:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-07-14 06:51:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:33,417 INFO L225 Difference]: With dead ends: 143 [2022-07-14 06:51:33,417 INFO L226 Difference]: Without dead ends: 143 [2022-07-14 06:51:33,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:51:33,417 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 24 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:33,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 931 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:51:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-14 06:51:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-14 06:51:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-14 06:51:33,420 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-07-14 06:51:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:33,421 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-14 06:51:33,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:51:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-14 06:51:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:51:33,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:33,422 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] [2022-07-14 06:51:33,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-14 06:51:33,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:33,627 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:33,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-07-14 06:51:33,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:33,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758919869] [2022-07-14 06:51:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:33,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:33,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:33,630 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:33,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:51:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:33,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:51:33,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:33,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:33,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:33,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:33,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758919869] [2022-07-14 06:51:33,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758919869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:33,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:33,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:51:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431550558] [2022-07-14 06:51:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:33,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:51:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:51:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:51:33,827 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:34,415 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-14 06:51:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:51:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:34,416 INFO L225 Difference]: With dead ends: 136 [2022-07-14 06:51:34,416 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 06:51:34,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:51:34,417 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:34,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 436 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:51:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 06:51:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-14 06:51:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-14 06:51:34,420 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-07-14 06:51:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:34,420 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-14 06:51:34,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-14 06:51:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:51:34,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:34,421 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] [2022-07-14 06:51:34,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-14 06:51:34,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:34,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-07-14 06:51:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:34,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604910830] [2022-07-14 06:51:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:34,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:34,631 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:34,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:51:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:34,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:51:34,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:34,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:34,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:51:34,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:34,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604910830] [2022-07-14 06:51:34,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604910830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:51:34,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:51:34,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:51:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028568851] [2022-07-14 06:51:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:51:34,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:51:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:51:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:51:34,860 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:35,388 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-14 06:51:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:51:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:51:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:35,389 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:51:35,389 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:51:35,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:51:35,390 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 20 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:35,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 466 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:51:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:51:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-14 06:51:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:51:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-14 06:51:35,393 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-07-14 06:51:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:35,393 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-14 06:51:35,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:51:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-14 06:51:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:51:35,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:35,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:35,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:35,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:35,604 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-07-14 06:51:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:35,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273297288] [2022-07-14 06:51:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:35,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:35,607 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:35,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:51:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:35,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:51:35,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:51:35,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 06:51:35,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273297288] [2022-07-14 06:51:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273297288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:51:35,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-14 06:51:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777754705] [2022-07-14 06:51:35,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:35,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:51:35,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:51:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:35,812 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 06:51:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:35,832 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-14 06:51:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:51:35,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-07-14 06:51:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:35,834 INFO L225 Difference]: With dead ends: 122 [2022-07-14 06:51:35,834 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:51:35,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:51:35,835 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 321 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:35,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 259 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:51:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:51:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-14 06:51:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:51:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-07-14 06:51:35,837 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-07-14 06:51:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:35,837 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-07-14 06:51:35,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 06:51:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-07-14 06:51:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:51:35,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:35,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:35,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:36,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:36,048 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:36,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-07-14 06:51:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:36,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818629761] [2022-07-14 06:51:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:36,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:36,051 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:36,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:51:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:36,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:51:36,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:36,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:36,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:36,365 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:51:36,365 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 18 treesize of output 25 [2022-07-14 06:51:36,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:36,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:36,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:36,654 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:51:36,654 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-14 06:51:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:51:36,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:36,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:36,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818629761] [2022-07-14 06:51:36,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818629761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:36,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1521218721] [2022-07-14 06:51:36,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:36,891 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:51:36,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:51:36,893 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:51:36,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-07-14 06:51:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:37,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 06:51:37,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:37,168 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:51:37,169 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-14 06:51:37,204 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:51:37,205 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 13 treesize of output 9 [2022-07-14 06:51:37,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:37,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:37,288 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:51:37,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 31 [2022-07-14 06:51:37,362 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:51:37,362 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 18 [2022-07-14 06:51:37,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:37,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:37,538 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:51:37,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-14 06:51:38,044 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:51:38,044 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 18 [2022-07-14 06:51:38,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:38,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:38,158 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:51:38,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-14 06:51:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 06:51:38,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:38,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1521218721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:38,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:38,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2022-07-14 06:51:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992462553] [2022-07-14 06:51:38,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:38,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:51:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:38,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:51:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:51:38,395 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:51:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:51:49,123 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-07-14 06:51:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:51:49,124 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-07-14 06:51:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:51:49,125 INFO L225 Difference]: With dead ends: 129 [2022-07-14 06:51:49,125 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 06:51:49,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-07-14 06:51:49,126 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 13 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:51:49,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 843 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 556 Unchecked, 0.4s Time] [2022-07-14 06:51:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 06:51:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-14 06:51:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.72) internal successors, (129), 123 states have internal predecessors, (129), 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-14 06:51:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-07-14 06:51:49,129 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 43 [2022-07-14 06:51:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:51:49,129 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-07-14 06:51:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:51:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-07-14 06:51:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:51:49,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:51:49,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:51:49,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:49,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:51:49,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:51:49,539 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:51:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:51:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2022-07-14 06:51:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:51:49,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122789084] [2022-07-14 06:51:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:49,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:51:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:51:49,541 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:51:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:51:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:49,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:51:49,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:49,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:49,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:49,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:49,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:51,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:51,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:51,910 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:51:51,911 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 12 [2022-07-14 06:51:51,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:54,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:54,715 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:51:54,716 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-14 06:51:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:51:54,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:55,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:51:55,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122789084] [2022-07-14 06:51:55,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122789084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:55,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1831050042] [2022-07-14 06:51:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:51:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:51:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:51:55,071 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:51:55,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-07-14 06:51:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:51:55,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:51:55,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:51:55,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:51:55,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:55,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:55,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:55,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:57,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:57,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:57,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:51:58,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:51:58,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:51:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 06:51:58,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:51:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1831050042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:51:58,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:51:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-14 06:51:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435841958] [2022-07-14 06:51:58,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:51:58,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:51:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:51:58,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:51:58,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=434, Unknown=3, NotChecked=0, Total=506 [2022-07-14 06:51:58,204 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 20 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:52:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:00,917 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-07-14 06:52:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:52:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-07-14 06:52:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:00,919 INFO L225 Difference]: With dead ends: 128 [2022-07-14 06:52:00,919 INFO L226 Difference]: Without dead ends: 128 [2022-07-14 06:52:00,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=112, Invalid=696, Unknown=4, NotChecked=0, Total=812 [2022-07-14 06:52:00,920 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 21 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:00,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 655 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 342 Unchecked, 0.4s Time] [2022-07-14 06:52:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-14 06:52:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-14 06:52:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 122 states have internal predecessors, (128), 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-14 06:52:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2022-07-14 06:52:00,923 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 43 [2022-07-14 06:52:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:00,923 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2022-07-14 06:52:00,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:52:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-07-14 06:52:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:52:00,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:00,924 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:00,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:01,138 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-14 06:52:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:01,328 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2022-07-14 06:52:01,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:01,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58828549] [2022-07-14 06:52:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:01,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:01,330 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:01,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 06:52:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:01,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:52:01,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:52:01,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:01,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:01,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58828549] [2022-07-14 06:52:01,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58828549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:01,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:01,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:52:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334291356] [2022-07-14 06:52:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:01,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:52:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:52:01,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:52:01,497 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:01,644 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-07-14 06:52:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:52:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-14 06:52:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:01,645 INFO L225 Difference]: With dead ends: 142 [2022-07-14 06:52:01,645 INFO L226 Difference]: Without dead ends: 142 [2022-07-14 06:52:01,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:52:01,645 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 89 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:01,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 107 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:52:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-14 06:52:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-07-14 06:52:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 118 states have internal predecessors, (124), 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-14 06:52:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2022-07-14 06:52:01,648 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 45 [2022-07-14 06:52:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:01,648 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2022-07-14 06:52:01,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-07-14 06:52:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:52:01,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:01,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:01,657 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-14 06:52:01,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:01,855 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2022-07-14 06:52:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:01,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784307459] [2022-07-14 06:52:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:01,858 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:01,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:52:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:02,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:52:02,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:52:02,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:02,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:02,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784307459] [2022-07-14 06:52:02,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784307459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:02,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:02,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:52:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97504037] [2022-07-14 06:52:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:02,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:52:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:52:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:52:02,053 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:52:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:02,178 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-07-14 06:52:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:52:02,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-07-14 06:52:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:02,179 INFO L225 Difference]: With dead ends: 120 [2022-07-14 06:52:02,179 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 06:52:02,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:52:02,179 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 271 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:02,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 119 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:52:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 06:52:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-14 06:52:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 75 states have (on average 1.6) internal successors, (120), 114 states have internal predecessors, (120), 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-14 06:52:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2022-07-14 06:52:02,182 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 45 [2022-07-14 06:52:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:02,182 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2022-07-14 06:52:02,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:52:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-07-14 06:52:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:52:02,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:02,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:02,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-14 06:52:02,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:02,391 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1119645598, now seen corresponding path program 1 times [2022-07-14 06:52:02,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:02,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366943289] [2022-07-14 06:52:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:02,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:02,392 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:02,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:52:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:02,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:52:02,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:02,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:52:02,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:02,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:02,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366943289] [2022-07-14 06:52:02,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366943289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:02,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:02,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:52:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358373141] [2022-07-14 06:52:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:02,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:52:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:02,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:52:02,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:52:02,583 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:02,943 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-07-14 06:52:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:52:02,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-07-14 06:52:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:02,944 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:52:02,944 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:52:02,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-14 06:52:02,944 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 82 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:02,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 255 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:52:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:52:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-07-14 06:52:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 110 states have internal predecessors, (116), 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-14 06:52:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2022-07-14 06:52:02,947 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 46 [2022-07-14 06:52:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:02,947 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2022-07-14 06:52:02,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-07-14 06:52:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:52:02,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:02,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:02,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:03,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:03,151 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1119645597, now seen corresponding path program 1 times [2022-07-14 06:52:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:03,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630577358] [2022-07-14 06:52:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:03,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:03,153 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:03,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:52:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:03,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:52:03,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:03,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:52:03,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:03,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:03,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630577358] [2022-07-14 06:52:03,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630577358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:03,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:03,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:52:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105516091] [2022-07-14 06:52:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:03,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:52:03,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:52:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:52:03,406 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:03,867 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-07-14 06:52:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:52:03,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-07-14 06:52:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:03,868 INFO L225 Difference]: With dead ends: 112 [2022-07-14 06:52:03,869 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 06:52:03,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-14 06:52:03,869 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 82 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:03,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 266 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:52:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 06:52:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-14 06:52:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 106 states have internal predecessors, (112), 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-14 06:52:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2022-07-14 06:52:03,872 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 46 [2022-07-14 06:52:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:03,872 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2022-07-14 06:52:03,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2022-07-14 06:52:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:52:03,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:03,873 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:03,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-14 06:52:04,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:04,081 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2022-07-14 06:52:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130022341] [2022-07-14 06:52:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:04,083 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:04,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:52:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:04,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:52:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:04,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:04,572 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 12 treesize of output 8 [2022-07-14 06:52:04,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:04,807 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 21 [2022-07-14 06:52:04,827 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 06:52:04,827 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 25 treesize of output 36 [2022-07-14 06:52:04,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 06:52:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:04,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:05,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:05,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130022341] [2022-07-14 06:52:05,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130022341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:05,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [615413397] [2022-07-14 06:52:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:05,173 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:52:05,175 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:52:05,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-07-14 06:52:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:05,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:52:05,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:05,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:05,961 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 12 treesize of output 8 [2022-07-14 06:52:06,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:06,184 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 21 [2022-07-14 06:52:06,203 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 06:52:06,203 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 25 treesize of output 36 [2022-07-14 06:52:06,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-14 06:52:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:06,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:06,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [615413397] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:06,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:52:06,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-07-14 06:52:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069064653] [2022-07-14 06:52:06,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:52:06,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:52:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:06,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:52:06,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=599, Unknown=6, NotChecked=0, Total=702 [2022-07-14 06:52:06,450 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 25 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:52:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:07,263 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-14 06:52:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:52:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-07-14 06:52:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:07,264 INFO L225 Difference]: With dead ends: 111 [2022-07-14 06:52:07,264 INFO L226 Difference]: Without dead ends: 111 [2022-07-14 06:52:07,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=955, Unknown=10, NotChecked=0, Total=1122 [2022-07-14 06:52:07,265 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:07,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 743 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 432 Invalid, 0 Unknown, 166 Unchecked, 0.6s Time] [2022-07-14 06:52:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-14 06:52:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-14 06:52:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.48) internal successors, (111), 105 states have internal predecessors, (111), 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-14 06:52:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2022-07-14 06:52:07,268 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 46 [2022-07-14 06:52:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:07,268 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2022-07-14 06:52:07,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:52:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-07-14 06:52:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:52:07,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:07,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:07,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:07,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:07,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:07,669 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2022-07-14 06:52:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459643757] [2022-07-14 06:52:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:07,671 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:07,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:52:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:07,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:52:07,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:08,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:08,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:08,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:08,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:08,420 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 22 treesize of output 14 [2022-07-14 06:52:08,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 7 treesize of output 3 [2022-07-14 06:52:08,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:08,752 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 28 treesize of output 28 [2022-07-14 06:52:08,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:08,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:52:08,773 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:52:08,774 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 19 treesize of output 19 [2022-07-14 06:52:08,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:08,783 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 14 treesize of output 16 [2022-07-14 06:52:08,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:52:08,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 15 treesize of output 7 [2022-07-14 06:52:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:08,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:09,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:09,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459643757] [2022-07-14 06:52:09,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459643757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:09,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [978092000] [2022-07-14 06:52:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:09,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:09,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:52:09,377 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:52:09,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-07-14 06:52:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:09,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 06:52:09,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:09,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:09,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:10,462 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 22 treesize of output 14 [2022-07-14 06:52:10,466 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 7 treesize of output 3 [2022-07-14 06:52:10,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:10,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:52:10,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:10,735 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 28 treesize of output 28 [2022-07-14 06:52:10,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:10,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:10,759 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:52:10,759 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 19 treesize of output 19 [2022-07-14 06:52:10,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:52:10,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:52:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:10,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [978092000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:11,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:52:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2022-07-14 06:52:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037317607] [2022-07-14 06:52:11,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:52:11,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:52:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:11,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:52:11,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=803, Unknown=15, NotChecked=0, Total=930 [2022-07-14 06:52:11,232 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:52:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:12,548 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-07-14 06:52:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:52:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-07-14 06:52:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:12,550 INFO L225 Difference]: With dead ends: 110 [2022-07-14 06:52:12,550 INFO L226 Difference]: Without dead ends: 110 [2022-07-14 06:52:12,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=183, Invalid=1280, Unknown=19, NotChecked=0, Total=1482 [2022-07-14 06:52:12,550 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:12,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 990 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 639 Invalid, 0 Unknown, 190 Unchecked, 0.9s Time] [2022-07-14 06:52:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-14 06:52:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-14 06:52:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 104 states have internal predecessors, (110), 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-14 06:52:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-07-14 06:52:12,553 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 46 [2022-07-14 06:52:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:12,553 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-07-14 06:52:12,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:52:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-07-14 06:52:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:52:12,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:12,554 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:12,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:12,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-14 06:52:12,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:12,956 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -645963432, now seen corresponding path program 1 times [2022-07-14 06:52:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:12,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779255146] [2022-07-14 06:52:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:12,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:12,980 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:12,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 06:52:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:13,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:52:13,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:52:13,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:13,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779255146] [2022-07-14 06:52:13,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779255146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:13,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:13,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:52:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436608647] [2022-07-14 06:52:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:13,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:52:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:13,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:52:13,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:52:13,208 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:52:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:13,369 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2022-07-14 06:52:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:52:13,370 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-14 06:52:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:13,370 INFO L225 Difference]: With dead ends: 125 [2022-07-14 06:52:13,370 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 06:52:13,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:52:13,371 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 160 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 119 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.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:13,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 119 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:52:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 06:52:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-14 06:52:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 101 states have internal predecessors, (107), 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-14 06:52:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-07-14 06:52:13,373 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 49 [2022-07-14 06:52:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:13,373 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-07-14 06:52:13,373 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:52:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-07-14 06:52:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:52:13,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:13,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:13,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-14 06:52:13,582 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-14 06:52:13,582 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:13,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash -645963431, now seen corresponding path program 1 times [2022-07-14 06:52:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:13,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554538628] [2022-07-14 06:52:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:13,584 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-14 06:52:13,585 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-14 06:52:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:13,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:52:13,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:52:13,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:13,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:13,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554538628] [2022-07-14 06:52:13,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554538628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:13,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:13,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:52:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330398596] [2022-07-14 06:52:13,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:13,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:52:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:52:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:52:13,868 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:52:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:14,042 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-14 06:52:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:52:14,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-14 06:52:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:14,044 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:52:14,044 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:52:14,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:52:14,045 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 215 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:14,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:52:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:52:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-14 06:52:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 98 states have internal predecessors, (104), 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-14 06:52:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2022-07-14 06:52:14,048 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 49 [2022-07-14 06:52:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:14,048 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2022-07-14 06:52:14,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:52:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-07-14 06:52:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:52:14,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:14,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:14,061 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-14 06:52:14,259 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-14 06:52:14,259 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1999401721, now seen corresponding path program 1 times [2022-07-14 06:52:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759129585] [2022-07-14 06:52:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:14,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:14,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:14,262 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-14 06:52:14,263 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-14 06:52:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:14,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 06:52:14,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:14,762 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 6 treesize of output 5 [2022-07-14 06:52:14,814 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 8 treesize of output 4 [2022-07-14 06:52:15,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:15,024 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 15 treesize of output 17 [2022-07-14 06:52:15,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:52:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:15,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:15,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759129585] [2022-07-14 06:52:15,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759129585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [89155819] [2022-07-14 06:52:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:52:15,185 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-14 06:52:15,186 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-14 06:52:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:15,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:52:15,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:15,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 8 treesize of output 4 [2022-07-14 06:52:16,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:16,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, 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 17 [2022-07-14 06:52:16,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:52:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:16,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:16,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [89155819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:16,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:52:16,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-07-14 06:52:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639813851] [2022-07-14 06:52:16,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:52:16,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:52:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:52:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=971, Unknown=62, NotChecked=0, Total=1190 [2022-07-14 06:52:16,323 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 32 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:52:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:17,105 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-07-14 06:52:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:52:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-14 06:52:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:17,106 INFO L225 Difference]: With dead ends: 117 [2022-07-14 06:52:17,106 INFO L226 Difference]: Without dead ends: 117 [2022-07-14 06:52:17,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=1550, Unknown=82, NotChecked=0, Total=1892 [2022-07-14 06:52:17,107 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 67 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:17,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1113 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 339 Invalid, 0 Unknown, 127 Unchecked, 0.4s Time] [2022-07-14 06:52:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-14 06:52:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2022-07-14 06:52:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 95 states have internal predecessors, (100), 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-14 06:52:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-14 06:52:17,110 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 51 [2022-07-14 06:52:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:17,110 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-14 06:52:17,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:52:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-14 06:52:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:52:17,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:17,111 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:17,122 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-14 06:52:17,327 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-14 06:52:17,520 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-14 06:52:17,521 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1685641326, now seen corresponding path program 1 times [2022-07-14 06:52:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831159206] [2022-07-14 06:52:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:17,523 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-14 06:52:17,524 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-14 06:52:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:17,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:52:17,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:17,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:52:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:52:17,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:17,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:17,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831159206] [2022-07-14 06:52:17,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831159206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:17,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:17,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:52:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885403933] [2022-07-14 06:52:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:52:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:52:17,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:52:17,795 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:18,198 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2022-07-14 06:52:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:52:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-07-14 06:52:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:18,199 INFO L225 Difference]: With dead ends: 118 [2022-07-14 06:52:18,199 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 06:52:18,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:52:18,200 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 59 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:18,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 263 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:52:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 06:52:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-07-14 06:52:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.375) internal successors, (99), 94 states have internal predecessors, (99), 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-14 06:52:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-07-14 06:52:18,203 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 52 [2022-07-14 06:52:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:18,203 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-07-14 06:52:18,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-07-14 06:52:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:52:18,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:18,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:18,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-14 06:52:18,404 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-14 06:52:18,404 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1685641325, now seen corresponding path program 1 times [2022-07-14 06:52:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:18,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181298988] [2022-07-14 06:52:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:18,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:18,407 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-14 06:52:18,409 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-14 06:52:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:18,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:52:18,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:18,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:52:18,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-14 06:52:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:52:18,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:52:18,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181298988] [2022-07-14 06:52:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181298988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:52:18,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:52:18,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:52:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654834882] [2022-07-14 06:52:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:52:18,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:52:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:52:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:52:18,829 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:19,441 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-07-14 06:52:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:52:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-07-14 06:52:19,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:19,443 INFO L225 Difference]: With dead ends: 99 [2022-07-14 06:52:19,443 INFO L226 Difference]: Without dead ends: 99 [2022-07-14 06:52:19,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:52:19,443 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:19,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 273 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:52:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-14 06:52:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-14 06:52:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 93 states have internal predecessors, (98), 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-14 06:52:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-07-14 06:52:19,446 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 52 [2022-07-14 06:52:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:19,446 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-07-14 06:52:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:52:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-07-14 06:52:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:52:19,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:19,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:19,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:19,655 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-14 06:52:19,655 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash -715273504, now seen corresponding path program 1 times [2022-07-14 06:52:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:19,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074457657] [2022-07-14 06:52:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:19,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:19,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:19,657 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-14 06:52:19,660 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-14 06:52:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:20,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:52:20,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:20,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:20,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:52:20,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:20,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2022-07-14 06:52:20,492 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:52:20,492 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 14 treesize of output 10 [2022-07-14 06:52:20,498 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 7 treesize of output 3 [2022-07-14 06:52:20,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:20,832 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:20,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-07-14 06:52:20,875 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-14 06:52:20,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 67 [2022-07-14 06:52:20,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:20,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:21,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:52:21,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:21,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 42 [2022-07-14 06:52:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:21,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:21,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:21,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074457657] [2022-07-14 06:52:21,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074457657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:21,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059793144] [2022-07-14 06:52:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:21,647 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:52:21,648 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:52:21,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-14 06:52:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:22,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-14 06:52:22,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:22,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:52:22,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:22,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2022-07-14 06:52:22,984 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 7 treesize of output 3 [2022-07-14 06:52:23,302 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-14 06:52:23,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 67 [2022-07-14 06:52:23,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:23,325 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:23,325 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 54 treesize of output 52 [2022-07-14 06:52:23,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:23,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:23,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:52:23,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:23,699 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:52:23,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 36 [2022-07-14 06:52:23,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:52:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:52:24,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1059793144] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:24,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:52:24,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2022-07-14 06:52:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721988341] [2022-07-14 06:52:24,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:52:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 06:52:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 06:52:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1633, Unknown=6, NotChecked=0, Total=1806 [2022-07-14 06:52:24,283 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 40 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:52:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:25,753 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-07-14 06:52:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:52:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-07-14 06:52:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:25,755 INFO L225 Difference]: With dead ends: 98 [2022-07-14 06:52:25,755 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 06:52:25,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=266, Invalid=2480, Unknown=10, NotChecked=0, Total=2756 [2022-07-14 06:52:25,756 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:25,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1072 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 603 Invalid, 0 Unknown, 234 Unchecked, 1.0s Time] [2022-07-14 06:52:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 06:52:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-14 06:52:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 92 states have internal predecessors, (97), 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-14 06:52:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-14 06:52:25,759 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 53 [2022-07-14 06:52:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:25,759 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-14 06:52:25,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:52:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-14 06:52:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:52:25,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:25,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:25,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-14 06:52:25,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-14 06:52:26,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:26,161 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash -715273503, now seen corresponding path program 1 times [2022-07-14 06:52:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:26,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699054275] [2022-07-14 06:52:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:26,163 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-14 06:52:26,164 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-14 06:52:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:26,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 06:52:26,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:26,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:26,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:26,917 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:52:26,918 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 21 treesize of output 28 [2022-07-14 06:52:26,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:52:27,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:52:27,262 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-14 06:52:27,493 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-14 06:52:27,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 42 [2022-07-14 06:52:27,503 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:52:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:52:27,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:52:27,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-14 06:52:27,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:27,869 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:27,869 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 72 treesize of output 62 [2022-07-14 06:52:27,899 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-14 06:52:27,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-07-14 06:52:27,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:27,933 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:52:27,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:52:27,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 06:52:28,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:52:28,220 INFO L356 Elim1Store]: treesize reduction 15, result has 55.9 percent of original size [2022-07-14 06:52:28,220 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 95 treesize of output 62 [2022-07-14 06:52:28,240 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-14 06:52:28,241 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 3 case distinctions, treesize of input 43 treesize of output 29 [2022-07-14 06:52:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:52:28,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:29,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:29,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699054275] [2022-07-14 06:52:29,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699054275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:29,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2038650245] [2022-07-14 06:52:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:29,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:29,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:52:29,156 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:52:29,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-14 06:52:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:29,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-14 06:52:29,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:29,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:29,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:30,234 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:52:30,234 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-14 06:52:30,269 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:52:30,269 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 21 treesize of output 28 [2022-07-14 06:52:31,035 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-14 06:52:31,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:52:31,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:31,462 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2022-07-14 06:52:31,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 06:52:31,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:31,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:52:32,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:32,087 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:32,087 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 74 treesize of output 64 [2022-07-14 06:52:32,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:32,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-07-14 06:52:32,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:32,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:32,123 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:52:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:52:32,147 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-14 06:52:32,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-14 06:52:32,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:52:32,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:32,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:32,922 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 102 treesize of output 50 [2022-07-14 06:52:32,946 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-14 06:52:32,946 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 21 [2022-07-14 06:52:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:52:33,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:33,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2038650245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:33,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:52:33,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 44 [2022-07-14 06:52:33,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301247385] [2022-07-14 06:52:33,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:52:33,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 06:52:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 06:52:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2320, Unknown=22, NotChecked=0, Total=2550 [2022-07-14 06:52:33,841 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 45 states, 40 states have (on average 1.975) internal successors, (79), 38 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:52:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:35,884 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-14 06:52:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:52:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 1.975) internal successors, (79), 38 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-07-14 06:52:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:35,886 INFO L225 Difference]: With dead ends: 97 [2022-07-14 06:52:35,886 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:52:35,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=339, Invalid=3790, Unknown=31, NotChecked=0, Total=4160 [2022-07-14 06:52:35,887 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 36 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:35,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 684 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 407 Unchecked, 0.4s Time] [2022-07-14 06:52:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:52:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-14 06:52:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 91 states have internal predecessors, (96), 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-14 06:52:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-07-14 06:52:35,890 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 53 [2022-07-14 06:52:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:35,890 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-07-14 06:52:35,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 1.975) internal successors, (79), 38 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:52:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-07-14 06:52:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:52:35,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:35,891 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:35,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2022-07-14 06:52:36,108 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-14 06:52:36,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:52:36,306 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:36,306 INFO L85 PathProgramCache]: Analyzing trace with hash 821274967, now seen corresponding path program 1 times [2022-07-14 06:52:36,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:36,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135532265] [2022-07-14 06:52:36,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:36,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:36,308 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-14 06:52:36,339 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-14 06:52:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:36,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 06:52:36,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:36,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:36,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:52:36,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:36,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:52:36,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:36,887 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-14 06:52:36,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2022-07-14 06:52:36,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:37,276 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-14 06:52:37,480 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:52:37,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2022-07-14 06:52:37,486 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 7 treesize of output 3 [2022-07-14 06:52:37,491 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-14 06:52:37,914 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:52:37,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:52:37,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:37,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:37,946 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:37,946 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 38 treesize of output 42 [2022-07-14 06:52:37,976 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 06:52:37,977 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 25 treesize of output 36 [2022-07-14 06:52:38,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:52:39,019 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-14 06:52:39,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 44 [2022-07-14 06:52:39,154 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:52:39,154 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 29 treesize of output 36 [2022-07-14 06:52:39,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:39,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:39,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-14 06:52:39,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-14 06:52:39,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:39,530 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:52:39,531 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 37 treesize of output 36 [2022-07-14 06:52:40,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-14 06:52:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:52:40,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:40,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3063) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3064) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3065) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:52:41,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3062) (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) v_ArrVal_3063)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| (_ bv4 32))) v_ArrVal_3064) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3065) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:52:41,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3062) .cse1 v_ArrVal_3063) (select (select |c_#memory_$Pointer$.base| .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3064))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3065) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:52:41,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3062) .cse1 v_ArrVal_3063) (select (select |c_#memory_$Pointer$.base| .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3064))) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3065) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:52:42,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:52:42,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135532265] [2022-07-14 06:52:42,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135532265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:42,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1288443708] [2022-07-14 06:52:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:42,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:52:42,264 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:52:42,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-14 06:52:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:42,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-14 06:52:42,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:43,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:44,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:52:44,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:44,740 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 18 [2022-07-14 06:52:44,744 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-14 06:52:44,748 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 7 treesize of output 3 [2022-07-14 06:52:44,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:44,999 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:45,000 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 37 treesize of output 41 [2022-07-14 06:52:45,026 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 06:52:45,026 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 25 treesize of output 36 [2022-07-14 06:52:45,065 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:52:45,065 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:52:45,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:47,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-14 06:52:49,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:52:49,026 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 1 case distinctions, treesize of input 69 treesize of output 43 [2022-07-14 06:52:49,409 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:52:49,410 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 21 treesize of output 30 [2022-07-14 06:52:49,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:49,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:49,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-14 06:52:49,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52: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 14 treesize of output 16 [2022-07-14 06:52:50,612 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:52:50,612 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 37 treesize of output 36 [2022-07-14 06:52:51,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-14 06:52:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:52:51,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:52:51,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3208) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3065) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:52:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1288443708] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:52:52,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:52:52,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 58 [2022-07-14 06:52:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279503278] [2022-07-14 06:52:52,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:52:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-14 06:52:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:52:52,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-14 06:52:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4807, Unknown=67, NotChecked=730, Total=6006 [2022-07-14 06:52:52,726 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 49 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:52:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:52:56,239 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-07-14 06:52:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-14 06:52:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 49 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-07-14 06:52:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:52:56,240 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:52:56,240 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:52:56,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=586, Invalid=7372, Unknown=72, NotChecked=900, Total=8930 [2022-07-14 06:52:56,242 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:52:56,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1031 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 676 Invalid, 0 Unknown, 171 Unchecked, 1.3s Time] [2022-07-14 06:52:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:52:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-14 06:52:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:52:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-07-14 06:52:56,245 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 58 [2022-07-14 06:52:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:52:56,246 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-07-14 06:52:56,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 49 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:52:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-07-14 06:52:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:52:56,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:52:56,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:52:56,263 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-14 06:52:56,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2022-07-14 06:52:56,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:52:56,660 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-14 06:52:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:52:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 821274968, now seen corresponding path program 1 times [2022-07-14 06:52:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:52:56,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892587541] [2022-07-14 06:52:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:52:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:52:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:52:56,662 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:52:56,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-14 06:52:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:52:57,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-14 06:52:57,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:52:57,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:57,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:57,238 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:52:57,238 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 12 [2022-07-14 06:52:57,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:57,568 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-14 06:52:57,756 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:52:57,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2022-07-14 06:52:57,762 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 7 treesize of output 3 [2022-07-14 06:52:57,766 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-14 06:52:57,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:52:58,181 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:52:58,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:52:58,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:58,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:58,217 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:52:58,218 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 38 treesize of output 42 [2022-07-14 06:52:58,240 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:52:58,240 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 19 treesize of output 19 [2022-07-14 06:52:59,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:52:59,404 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-07-14 06:52:59,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 38 [2022-07-14 06:52:59,411 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 11 [2022-07-14 06:52:59,548 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:52:59,549 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:52:59,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:59,580 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:52:59,580 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 29 treesize of output 36 [2022-07-14 06:52:59,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:52:59,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:59,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:59,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:59,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-14 06:52:59,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-14 06:52:59,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:59,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:52:59,940 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:52:59,940 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 42 [2022-07-14 06:52:59,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:52:59,949 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 18 treesize of output 20 [2022-07-14 06:53:00,096 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 32 treesize of output 16 [2022-07-14 06:53:00,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:53:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:53:00,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:53:00,665 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-14 06:53:00,695 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-14 06:53:00,749 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-14 06:53:02,443 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-14 06:53:04,842 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-14 06:53:06,666 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3355) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-14 06:53:07,758 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) .cse1 v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3352) .cse1 v_ArrVal_3355) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-14 06:53:10,514 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) .cse0 v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3352) .cse0 v_ArrVal_3355) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2022-07-14 06:53:23,185 WARN L233 SmtUtils]: Spent 7.23s 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) [2022-07-14 06:53:26,264 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) .cse2 v_ArrVal_3354) (select (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3357)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) (bvadd (_ bv4 32) (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3353) .cse4 v_ArrVal_3354) .cse5 v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3352) .cse4 v_ArrVal_3355) .cse5 v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-14 06:53:29,825 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3353) .cse2 v_ArrVal_3354) (select (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3357)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) (bvadd (_ bv4 32) (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3353) .cse4 v_ArrVal_3354) .cse5 v_ArrVal_3357) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3352) .cse4 v_ArrVal_3355) .cse5 v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3358) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-14 06:53:34,177 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 322 treesize of output 260 [2022-07-14 06:53:53,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:53:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892587541] [2022-07-14 06:53:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892587541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:53:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632456057] [2022-07-14 06:53:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:53:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:53:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:53:53,338 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:53:53,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-07-14 06:53:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:53:54,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 06:53:54,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:54:14,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:54:37,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:54:49,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:54:49,034 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 18 [2022-07-14 06:54:49,116 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-14 06:54:49,251 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 7 treesize of output 3 [2022-07-14 06:54:49,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:54:58,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:54:58,539 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:54:58,540 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 37 treesize of output 41 [2022-07-14 06:54:58,996 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:54:58,997 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 19 treesize of output 19 [2022-07-14 06:55:00,364 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:55:00,364 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:55:00,529 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