./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-791161d [2022-07-23 06:29:47,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:29:47,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:29:47,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:29:47,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:29:47,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:29:47,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:29:47,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:29:47,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:29:47,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:29:47,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:29:47,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:29:47,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:29:47,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:29:47,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:29:47,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:29:47,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:29:47,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:29:47,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:29:47,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:29:47,993 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:29:47,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:29:47,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:29:47,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:29:47,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:29:47,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:29:47,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:29:47,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:29:48,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:29:48,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:29:48,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:29:48,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:29:48,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:29:48,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:29:48,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:29:48,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:29:48,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:29:48,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:29:48,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:29:48,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:29:48,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:29:48,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:29:48,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:29:48,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:29:48,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:29:48,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:29:48,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:29:48,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:29:48,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:29:48,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:29:48,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:29:48,043 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:29:48,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:29:48,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:29:48,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:29:48,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:29:48,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:29:48,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:29:48,045 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:29:48,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:29:48,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:29:48,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:29:48,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:29:48,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:29:48,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:29:48,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:29:48,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:29:48,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:29:48,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:29:48,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:29:48,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:29:48,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:29:48,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:29:48,049 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-23 06:29:48,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:29:48,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:29:48,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:29:48,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:29:48,285 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:29:48,286 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-23 06:29:48,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/defd2e2bc/5361d250b808473c89f0d12bd315f2e9/FLAGcaf2a571e [2022-07-23 06:29:48,765 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:29:48,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2022-07-23 06:29:48,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/defd2e2bc/5361d250b808473c89f0d12bd315f2e9/FLAGcaf2a571e [2022-07-23 06:29:49,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/defd2e2bc/5361d250b808473c89f0d12bd315f2e9 [2022-07-23 06:29:49,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:29:49,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:29:49,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:29:49,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:29:49,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:29:49,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f18cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49, skipping insertion in model container [2022-07-23 06:29:49,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:29:49,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:29:49,473 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-23 06:29:49,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:29:49,482 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:29:49,520 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-23 06:29:49,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:29:49,548 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:29:49,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49 WrapperNode [2022-07-23 06:29:49,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:29:49,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:29:49,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:29:49,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:29:49,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,597 INFO L137 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2022-07-23 06:29:49,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:29:49,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:29:49,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:29:49,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:29:49,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:29:49,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:29:49,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:29:49,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:29:49,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (1/1) ... [2022-07-23 06:29:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:29:49,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:49,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:29:49,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:29:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:29:49,709 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:29:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:29:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:29:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:29:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:29:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:29:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:29:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:29:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:29:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:29:49,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:29:49,802 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:29:49,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:29:50,212 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:29:50,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:29:50,219 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:29:50,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:29:50 BoogieIcfgContainer [2022-07-23 06:29:50,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:29:50,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:29:50,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:29:50,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:29:50,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:29:49" (1/3) ... [2022-07-23 06:29:50,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d19c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:29:50, skipping insertion in model container [2022-07-23 06:29:50,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:49" (2/3) ... [2022-07-23 06:29:50,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d19c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:29:50, skipping insertion in model container [2022-07-23 06:29:50,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:29:50" (3/3) ... [2022-07-23 06:29:50,229 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2022-07-23 06:29:50,241 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:29:50,245 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-23 06:29:50,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:29:50,318 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@1857c146, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@712ef723 [2022-07-23 06:29:50,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-23 06:29:50,321 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-23 06:29:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:29:50,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:50,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:29:50,341 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-23 06:29:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-07-23 06:29:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:50,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421309180] [2022-07-23 06:29:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:29:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:50,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421309180] [2022-07-23 06:29:50,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421309180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:50,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:50,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:29:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084635595] [2022-07-23 06:29:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:50,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:29:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:29:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:29:50,551 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-23 06:29:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:50,710 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-23 06:29:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:29:50,713 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-23 06:29:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:50,725 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:29:50,726 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:29:50,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:29:50,735 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-23 06:29:50,736 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-23 06:29:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:29:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 06:29:50,773 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-23 06:29:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-23 06:29:50,776 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-07-23 06:29:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:50,777 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-23 06:29:50,777 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-23 06:29:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-23 06:29:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:29:50,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:50,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:29:50,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:29:50,780 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-23 06:29:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-07-23 06:29:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:50,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956767093] [2022-07-23 06:29:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:50,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:29:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:50,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956767093] [2022-07-23 06:29:50,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956767093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:50,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:50,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:29:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420108731] [2022-07-23 06:29:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:50,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:29:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:29:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:29:50,862 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-23 06:29:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:50,975 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-23 06:29:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:29:50,976 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-23 06:29:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:50,979 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:29:50,979 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:29:50,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:29:50,981 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:50,982 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-23 06:29:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:29:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:29:50,995 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-23 06:29:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-23 06:29:50,999 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-07-23 06:29:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:51,001 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-23 06:29:51,002 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-23 06:29:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-23 06:29:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:29:51,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:51,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:29:51,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:29:51,004 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-23 06:29:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-07-23 06:29:51,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:51,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670788710] [2022-07-23 06:29:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:29:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:51,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670788710] [2022-07-23 06:29:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670788710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:51,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:51,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:29:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042066103] [2022-07-23 06:29:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:29:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:29:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:29:51,148 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-23 06:29:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:51,282 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-23 06:29:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:29:51,283 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-23 06:29:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:51,285 INFO L225 Difference]: With dead ends: 140 [2022-07-23 06:29:51,285 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 06:29:51,286 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-23 06:29:51,292 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-23 06:29:51,294 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-23 06:29:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 06:29:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-07-23 06:29:51,315 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-23 06:29:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-23 06:29:51,319 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-07-23 06:29:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:51,320 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-23 06:29:51,320 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-23 06:29:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-23 06:29:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:29:51,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:51,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:29:51,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:29:51,322 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-23 06:29:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-07-23 06:29:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:51,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765624094] [2022-07-23 06:29:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,508 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-23 06:29:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:51,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765624094] [2022-07-23 06:29:51,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765624094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:51,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:51,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:29:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127169150] [2022-07-23 06:29:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:51,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:29:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:29:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:29:51,512 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-23 06:29:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:51,763 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-23 06:29:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:51,764 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-23 06:29:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:51,766 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:29:51,766 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:29:51,767 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-23 06:29:51,768 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:29:51,768 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-23 06:29:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:29:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-23 06:29:51,773 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-23 06:29:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-23 06:29:51,774 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-07-23 06:29:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:51,775 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-23 06:29:51,775 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-23 06:29:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-23 06:29:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:29:51,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:51,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:29:51,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:29:51,776 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-23 06:29:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-07-23 06:29:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:51,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903701342] [2022-07-23 06:29:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:51,912 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-23 06:29:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:51,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903701342] [2022-07-23 06:29:51,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903701342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:51,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:51,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:29:51,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607651384] [2022-07-23 06:29:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:51,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:29:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:51,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:29:51,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:29:51,917 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-23 06:29:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:52,157 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-23 06:29:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:52,161 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-23 06:29:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:52,162 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:29:52,162 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:29:52,162 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-23 06:29:52,163 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:29:52,163 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-23 06:29:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:29:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-23 06:29:52,168 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-23 06:29:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-07-23 06:29:52,168 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-07-23 06:29:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:52,169 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-07-23 06:29:52,169 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-23 06:29:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-07-23 06:29:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:29:52,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:52,170 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-23 06:29:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:29:52,170 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-23 06:29:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-07-23 06:29:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446128709] [2022-07-23 06:29:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,369 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-23 06:29:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:52,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446128709] [2022-07-23 06:29:52,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446128709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:52,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759915602] [2022-07-23 06:29:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:52,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:52,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:52,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:29:52,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 06:29:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:29:52,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:52,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:29:52,725 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:29:52,726 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-23 06:29:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:29:52,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:52,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759915602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:52,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:29:52,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-23 06:29:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578866526] [2022-07-23 06:29:52,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:52,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:29:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:52,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:29:52,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:29:52,815 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-23 06:29:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:53,161 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2022-07-23 06:29:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:53,161 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-23 06:29:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:53,162 INFO L225 Difference]: With dead ends: 153 [2022-07-23 06:29:53,162 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 06:29:53,163 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-23 06:29:53,163 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:53,164 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.3s Time] [2022-07-23 06:29:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 06:29:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2022-07-23 06:29:53,168 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-23 06:29:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-23 06:29:53,169 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-07-23 06:29:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:53,170 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-23 06:29:53,170 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-23 06:29:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-23 06:29:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:29:53,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:53,171 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-23 06:29:53,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:29:53,391 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-23 06:29:53,392 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-23 06:29:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-07-23 06:29:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:53,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105166560] [2022-07-23 06:29:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,613 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-23 06:29:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:53,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105166560] [2022-07-23 06:29:53,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105166560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:53,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657622383] [2022-07-23 06:29:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:53,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:53,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:53,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:29:53,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 06:29:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:29:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:53,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:29:53,996 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:29:53,997 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-23 06:29:54,015 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:29:54,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:29:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:29:54,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:56,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657622383] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:56,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:29:56,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-23 06:29:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079804170] [2022-07-23 06:29:56,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:29:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:29:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:29:56,225 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-23 06:29:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:56,862 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-23 06:29:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:29:56,863 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-23 06:29:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:56,864 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:29:56,864 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:29:56,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:29:56,865 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-23 06:29:56,865 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-23 06:29:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:29:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-23 06:29:56,875 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-23 06:29:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-23 06:29:56,877 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-07-23 06:29:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:56,878 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-23 06:29:56,878 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-23 06:29:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-23 06:29:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:29:56,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:56,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:29:56,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:29:57,093 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-23 06:29:57,093 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-23 06:29:57,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-07-23 06:29:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:57,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950915653] [2022-07-23 06:29:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,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-23 06:29:57,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950915653] [2022-07-23 06:29:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950915653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103287285] [2022-07-23 06:29:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:57,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:29:57,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 06:29:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:29:57,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:57,356 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-23 06:29:57,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:57,416 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-23 06:29:57,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103287285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:29:57,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:29:57,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-23 06:29:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785326157] [2022-07-23 06:29:57,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:57,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:29:57,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:29:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:29:57,418 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-23 06:29:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:57,552 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-23 06:29:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:57,553 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-23 06:29:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:57,554 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:29:57,554 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:29:57,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:29:57,555 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-23 06:29:57,556 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-23 06:29:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:29:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-23 06:29:57,559 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-23 06:29:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-23 06:29:57,560 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-07-23 06:29:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:57,561 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-23 06:29:57,561 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-23 06:29:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-23 06:29:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:29:57,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:57,562 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-23 06:29:57,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:29:57,767 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-23 06:29:57,768 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-23 06:29:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-07-23 06:29:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:57,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220829967] [2022-07-23 06:29:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,844 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-23 06:29:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:57,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220829967] [2022-07-23 06:29:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220829967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:57,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837141568] [2022-07-23 06:29:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:57,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:29:57,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:29:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:57,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:29:57,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:57,991 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-23 06:29:57,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:58,002 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:29:58,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 06:29:58,020 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-23 06:29:58,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837141568] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:29:58,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:29:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-23 06:29:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076211520] [2022-07-23 06:29:58,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:58,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:29:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:58,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:29:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:29:58,022 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-23 06:29:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:58,206 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-07-23 06:29:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:58,206 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-23 06:29:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:58,207 INFO L225 Difference]: With dead ends: 138 [2022-07-23 06:29:58,207 INFO L226 Difference]: Without dead ends: 138 [2022-07-23 06:29:58,208 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-23 06:29:58,208 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:58,208 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.2s Time] [2022-07-23 06:29:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-23 06:29:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-23 06:29:58,212 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-23 06:29:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-23 06:29:58,213 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-07-23 06:29:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:58,213 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-23 06:29:58,213 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-23 06:29:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-23 06:29:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:29:58,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:58,214 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-23 06:29:58,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:29:58,423 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-23 06:29:58,423 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-23 06:29:58,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-07-23 06:29:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:58,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632216167] [2022-07-23 06:29:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:58,544 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-23 06:29:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632216167] [2022-07-23 06:29:58,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632216167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837801134] [2022-07-23 06:29:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:58,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:58,547 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:29:58,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:29:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:58,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:29:58,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:58,793 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-23 06:29:58,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:58,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:29:58,829 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-23 06:29:58,953 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-23 06:29:58,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837801134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:29:58,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:29:58,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-23 06:29:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107191952] [2022-07-23 06:29:58,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:58,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:29:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:29:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:29:58,956 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-23 06:29:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:59,273 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-23 06:29:59,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:29:59,273 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-23 06:29:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:59,274 INFO L225 Difference]: With dead ends: 143 [2022-07-23 06:29:59,274 INFO L226 Difference]: Without dead ends: 143 [2022-07-23 06:29:59,275 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-23 06:29:59,275 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:59,275 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.3s Time] [2022-07-23 06:29:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-23 06:29:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-23 06:29:59,279 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-23 06:29:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-23 06:29:59,280 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-07-23 06:29:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:59,280 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-23 06:29:59,280 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-23 06:29:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-23 06:29:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:29:59,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:59,281 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-23 06:29:59,311 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-23 06:29:59,491 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-23 06:29:59,492 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-23 06:29:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-07-23 06:29:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:59,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090175637] [2022-07-23 06:29:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:59,590 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-23 06:29:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:59,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090175637] [2022-07-23 06:29:59,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090175637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:59,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:59,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:29:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209034764] [2022-07-23 06:29:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:59,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:29:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:59,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:29:59,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:29:59,595 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-23 06:29:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:59,872 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-23 06:29:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:29:59,873 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-23 06:29:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:59,874 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:29:59,874 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:29:59,874 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-23 06:29:59,875 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 23 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:29:59,875 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-23 06:29:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:29:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-23 06:29:59,878 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-23 06:29:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-23 06:29:59,878 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-07-23 06:29:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:59,878 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-23 06:29:59,879 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-23 06:29:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-23 06:29:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:29:59,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:59,879 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-23 06:29:59,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:29:59,880 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-23 06:29:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-07-23 06:29:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:59,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078117705] [2022-07-23 06:29:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:59,991 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-23 06:29:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078117705] [2022-07-23 06:29:59,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078117705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:59,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:59,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:29:59,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71824063] [2022-07-23 06:29:59,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:59,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:29:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:29:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:29:59,994 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-23 06:30:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:00,268 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-23 06:30:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:30:00,268 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-23 06:30:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:00,269 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:00,269 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:00,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:30:00,270 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:30:00,270 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-23 06:30:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-23 06:30:00,273 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-23 06:30:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-23 06:30:00,273 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-07-23 06:30:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:00,274 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-23 06:30:00,274 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-23 06:30:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-23 06:30:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:30:00,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:00,275 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-23 06:30:00,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:30:00,278 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-23 06:30:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-07-23 06:30:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:00,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064378741] [2022-07-23 06:30:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 06:30:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,385 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-23 06:30:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:00,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064378741] [2022-07-23 06:30:00,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064378741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:00,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215221762] [2022-07-23 06:30:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:00,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:00,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:30:00,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:30:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:00,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:00,587 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-23 06:30:00,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:00,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215221762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:00,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:30:00,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-23 06:30:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869281019] [2022-07-23 06:30:00,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:00,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:30:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:30:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:30:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:00,589 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-23 06:30:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:00,600 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-23 06:30:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:30:00,601 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-23 06:30:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:00,602 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:30:00,602 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:30:00,602 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-23 06:30:00,603 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-23 06:30:00,603 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-23 06:30:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:30:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 06:30:00,608 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-23 06:30:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-07-23 06:30:00,608 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-07-23 06:30:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:00,609 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-07-23 06:30:00,609 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-23 06:30:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-07-23 06:30:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:30:00,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:00,613 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-23 06:30:00,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:00,831 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-23 06:30:00,832 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-23 06:30:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-07-23 06:30:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:30:00,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732946920] [2022-07-23 06:30:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:30:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:30:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:30:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 06:30:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:01,076 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-23 06:30:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:30:01,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732946920] [2022-07-23 06:30:01,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732946920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:01,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895023885] [2022-07-23 06:30:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:30:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:01,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:30:01,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:30:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:01,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:30:01,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:01,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:01,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:01,382 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-23 06:30:01,405 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-23 06:30:01,595 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-23 06:30:01,596 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 91111 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-23 06:30:01,600 INFO L158 Benchmark]: Toolchain (without parser) took 12462.80ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 89.1MB in the beginning and 90.0MB in the end (delta: -840.8kB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-07-23 06:30:01,600 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:30:01,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.00ms. Allocated memory is still 121.6MB. Free memory was 88.8MB in the beginning and 89.3MB in the end (delta: -584.3kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 06:30:01,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 121.6MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:30:01,601 INFO L158 Benchmark]: Boogie Preprocessor took 28.73ms. Allocated memory is still 121.6MB. Free memory was 86.8MB in the beginning and 85.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:30:01,601 INFO L158 Benchmark]: RCFGBuilder took 591.98ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 62.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-23 06:30:01,601 INFO L158 Benchmark]: TraceAbstraction took 11376.74ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 62.1MB in the beginning and 90.0MB in the end (delta: -27.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:30:01,603 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.20ms. Allocated memory is still 92.3MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.00ms. Allocated memory is still 121.6MB. Free memory was 88.8MB in the beginning and 89.3MB in the end (delta: -584.3kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 121.6MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.73ms. Allocated memory is still 121.6MB. Free memory was 86.8MB in the beginning and 85.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.98ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 62.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11376.74ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 62.1MB in the beginning and 90.0MB in the end (delta: -27.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 91111 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 91111 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-23 06:30:01,621 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-?-791161d [2022-07-23 06:30:03,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:30:03,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:30:03,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:30:03,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:30:03,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:30:03,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:30:03,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:30:03,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:30:03,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:30:03,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:30:03,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:30:03,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:30:03,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:30:03,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:30:03,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:30:03,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:30:03,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:30:03,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:30:03,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:30:03,719 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:30:03,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:30:03,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:30:03,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:30:03,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:30:03,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:30:03,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:30:03,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:30:03,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:30:03,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:30:03,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:30:03,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:30:03,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:30:03,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:30:03,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:30:03,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:30:03,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:30:03,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:30:03,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:30:03,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:30:03,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:30:03,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:30:03,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:30:03,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:30:03,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:30:03,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:30:03,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:30:03,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:30:03,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:30:03,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:30:03,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:30:03,787 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:30:03,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:30:03,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:30:03,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:30:03,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:30:03,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:30:03,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:30:03,789 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:30:03,789 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:30:03,789 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:30:03,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:30:03,790 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:30:03,790 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:30:03,790 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:30:03,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:30:03,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:30:03,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:30:03,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:30:03,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:30:03,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:30:03,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:30:03,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:30:03,792 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:30:03,792 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:03,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:30:03,793 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-23 06:30:04,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:30:04,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:30:04,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:30:04,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:30:04,136 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:30:04,138 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-23 06:30:04,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09633b3e/ead5a66a02574b87ba6a960966bac289/FLAG5d0b53b57 [2022-07-23 06:30:04,753 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:30:04,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2022-07-23 06:30:04,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09633b3e/ead5a66a02574b87ba6a960966bac289/FLAG5d0b53b57 [2022-07-23 06:30:05,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09633b3e/ead5a66a02574b87ba6a960966bac289 [2022-07-23 06:30:05,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:30:05,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:30:05,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:30:05,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:30:05,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:30:05,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bfb8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05, skipping insertion in model container [2022-07-23 06:30:05,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:30:05,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:30:05,619 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-23 06:30:05,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:30:05,637 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:30:05,699 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-23 06:30:05,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:30:05,736 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:30:05,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05 WrapperNode [2022-07-23 06:30:05,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:30:05,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:30:05,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:30:05,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:30:05,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,807 INFO L137 Inliner]: procedures = 130, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 150 [2022-07-23 06:30:05,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:30:05,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:30:05,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:30:05,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:30:05,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:30:05,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:30:05,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:30:05,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:30:05,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (1/1) ... [2022-07-23 06:30:05,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:30:05,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:05,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:30:05,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:30:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 06:30:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:30:05,927 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:30:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:30:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:30:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:30:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:30:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:30:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:30:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:30:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:30:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:30:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:30:05,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:30:06,038 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:30:06,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:30:06,666 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:30:06,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:30:06,677 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:30:06,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:30:06 BoogieIcfgContainer [2022-07-23 06:30:06,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:30:06,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:30:06,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:30:06,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:30:06,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:30:05" (1/3) ... [2022-07-23 06:30:06,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bc7b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:30:06, skipping insertion in model container [2022-07-23 06:30:06,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:05" (2/3) ... [2022-07-23 06:30:06,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bc7b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:30:06, skipping insertion in model container [2022-07-23 06:30:06,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:30:06" (3/3) ... [2022-07-23 06:30:06,688 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2022-07-23 06:30:06,702 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:30:06,702 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-23 06:30:06,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:30:06,765 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@fa8dc35, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7cb40350 [2022-07-23 06:30:06,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-23 06:30:06,772 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-23 06:30:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:30:06,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:06,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:30:06,783 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-23 06:30:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-07-23 06:30:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:06,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036625293] [2022-07-23 06:30:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:06,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:06,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 06:30:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:06,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:30:06,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:06,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:06,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:06,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:06,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036625293] [2022-07-23 06:30:06,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036625293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:06,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129149179] [2022-07-23 06:30:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:07,024 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-23 06:30:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:07,308 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-23 06:30:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:07,311 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-23 06:30:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:07,320 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:30:07,321 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:30:07,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:07,326 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:30:07,328 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-23 06:30:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:30:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 06:30:07,374 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-23 06:30:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-23 06:30:07,385 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-07-23 06:30:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:07,386 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-23 06:30:07,386 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-23 06:30:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-23 06:30:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:30:07,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:07,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:30:07,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:07,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:07,596 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-23 06:30:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-07-23 06:30:07,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:07,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148559719] [2022-07-23 06:30:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:07,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:07,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 06:30:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:07,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:30:07,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:07,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:07,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:07,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:07,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148559719] [2022-07-23 06:30:07,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148559719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:07,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:07,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673199047] [2022-07-23 06:30:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:07,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:07,720 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-23 06:30:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:08,000 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-23 06:30:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:08,002 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-23 06:30:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:08,003 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:30:08,003 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:30:08,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:08,004 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:08,005 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.3s Time] [2022-07-23 06:30:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:30:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:30:08,011 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-23 06:30:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-23 06:30:08,014 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-07-23 06:30:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:08,014 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-23 06:30:08,014 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-23 06:30:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-23 06:30:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:30:08,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:08,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:08,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:08,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:08,225 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-23 06:30:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-07-23 06:30:08,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:08,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659869614] [2022-07-23 06:30:08,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:08,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:08,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:08,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:08,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 06:30:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:08,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:30:08,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:08,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:08,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:08,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659869614] [2022-07-23 06:30:08,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659869614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:08,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:08,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:30:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176268072] [2022-07-23 06:30:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:08,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:08,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:08,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:08,321 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-23 06:30:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:08,333 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-23 06:30:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:08,335 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-23 06:30:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:08,336 INFO L225 Difference]: With dead ends: 140 [2022-07-23 06:30:08,336 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 06:30:08,336 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-23 06:30:08,337 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-23 06:30:08,338 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-23 06:30:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 06:30:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-07-23 06:30:08,346 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-23 06:30:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-23 06:30:08,347 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-07-23 06:30:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:08,347 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-23 06:30:08,347 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-23 06:30:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-23 06:30:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:30:08,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:08,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:08,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:08,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:08,558 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-23 06:30:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-07-23 06:30:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:08,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505472429] [2022-07-23 06:30:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:08,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:08,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 06:30:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:08,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:30:08,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:08,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:08,714 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-23 06:30:08,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:08,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505472429] [2022-07-23 06:30:08,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505472429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:08,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:08,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384258607] [2022-07-23 06:30:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:08,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:08,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:08,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:08,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:08,717 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-23 06:30:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:09,172 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-23 06:30:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:09,173 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-23 06:30:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:09,175 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:30:09,175 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:30:09,176 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-23 06:30:09,176 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 20 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:09,177 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.4s Time] [2022-07-23 06:30:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:30:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-23 06:30:09,184 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-23 06:30:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-23 06:30:09,185 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-07-23 06:30:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:09,185 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-23 06:30:09,186 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-23 06:30:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-23 06:30:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:30:09,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:09,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:09,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:09,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:09,407 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-23 06:30:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-07-23 06:30:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:09,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833344711] [2022-07-23 06:30:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:09,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:09,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:09,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:09,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 06:30:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:09,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:30:09,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:09,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:09,645 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-23 06:30:09,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:09,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:09,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833344711] [2022-07-23 06:30:09,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833344711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:09,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995998607] [2022-07-23 06:30:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:09,648 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-23 06:30:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:10,120 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-23 06:30:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:10,121 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-23 06:30:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:10,122 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:30:10,122 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:30:10,122 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-23 06:30:10,123 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:10,123 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.4s Time] [2022-07-23 06:30:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:30:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-23 06:30:10,128 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-23 06:30:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-07-23 06:30:10,129 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-07-23 06:30:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:10,129 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-07-23 06:30:10,130 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-23 06:30:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-07-23 06:30:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:30:10,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:10,131 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-23 06:30:10,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:10,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:10,332 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-23 06:30:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-07-23 06:30:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:10,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177297385] [2022-07-23 06:30:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:10,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:10,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:10,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:10,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 06:30:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:10,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:30:10,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:10,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:10,664 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:30:10,664 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-23 06:30:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:10,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:12,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:12,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177297385] [2022-07-23 06:30:12,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177297385] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:12,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:12,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-23 06:30:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044739391] [2022-07-23 06:30:12,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:12,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:30:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:30:12,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2022-07-23 06:30:12,940 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-23 06:30:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:13,479 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-23 06:30:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:13,480 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-23 06:30:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:13,480 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:30:13,481 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:30:13,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2022-07-23 06:30:13,482 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:13,482 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.5s Time] [2022-07-23 06:30:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:30:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-23 06:30:13,488 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-23 06:30:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-23 06:30:13,489 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-07-23 06:30:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:13,489 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-23 06:30:13,489 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-23 06:30:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-23 06:30:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:30:13,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:13,491 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-23 06:30:13,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:13,702 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-23 06:30:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-07-23 06:30:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626621312] [2022-07-23 06:30:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:13,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:13,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 06:30:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:13,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:30:13,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:13,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:13,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:14,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:14,144 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-23 06:30:14,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:14,158 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-23 06:30:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:14,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:16,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:16,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626621312] [2022-07-23 06:30:16,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626621312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:16,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [504758575] [2022-07-23 06:30:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:16,465 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:16,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:16,475 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-23 06:30:16,491 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-23 06:30:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:16,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:30:16,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:16,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:16,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:18,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:18,934 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-23 06:30:18,946 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:18,946 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-23 06:30:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:30:18,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:21,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [504758575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:21,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:21,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-23 06:30:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937125465] [2022-07-23 06:30:21,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:21,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:30:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:30:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:30:21,185 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-23 06:30:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:21,879 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-23 06:30:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:30:21,879 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-23 06:30:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:21,880 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:30:21,880 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:30:21,881 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=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:30:21,881 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 3 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:21,882 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.6s Time] [2022-07-23 06:30:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:30:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-23 06:30:21,885 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-23 06:30:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-23 06:30:21,886 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-07-23 06:30:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:21,886 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-23 06:30:21,887 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-23 06:30:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-23 06:30:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:30:21,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:21,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:21,895 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-23 06:30:22,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-23 06:30:22,291 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-23 06:30:22,292 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-23 06:30:22,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-07-23 06:30:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:22,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748381948] [2022-07-23 06:30:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:22,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:22,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:22,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 06:30:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:22,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:22,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:22,450 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-23 06:30:22,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:22,503 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-23 06:30:22,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:22,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748381948] [2022-07-23 06:30:22,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748381948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:22,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:22,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-23 06:30:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149046351] [2022-07-23 06:30:22,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:22,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:22,505 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-23 06:30:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:22,673 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-23 06:30:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:22,674 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-23 06:30:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:22,675 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:22,675 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:22,675 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-23 06:30:22,676 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:22,676 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.2s Time] [2022-07-23 06:30:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-23 06:30:22,679 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-23 06:30:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-23 06:30:22,680 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-07-23 06:30:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:22,680 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-23 06:30:22,681 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-23 06:30:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-23 06:30:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:30:22,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:22,681 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-23 06:30:22,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:22,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:22,892 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-23 06:30:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-07-23 06:30:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:22,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187514110] [2022-07-23 06:30:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:22,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:22,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:22,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 06:30:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:30:23,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:23,047 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-23 06:30:23,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:23,060 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:30:23,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 06:30:23,080 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-23 06:30:23,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:23,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187514110] [2022-07-23 06:30:23,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187514110] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:23,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:23,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-23 06:30:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124944290] [2022-07-23 06:30:23,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:30:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:30:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:30:23,083 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-23 06:30:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:23,349 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-07-23 06:30:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:30:23,350 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-23 06:30:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:23,351 INFO L225 Difference]: With dead ends: 138 [2022-07-23 06:30:23,351 INFO L226 Difference]: Without dead ends: 138 [2022-07-23 06:30:23,351 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-23 06:30:23,352 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:30:23,352 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-23 06:30:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-23 06:30:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-23 06:30:23,355 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-23 06:30:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-23 06:30:23,356 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-07-23 06:30:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:23,357 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-23 06:30:23,357 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-23 06:30:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-23 06:30:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:30:23,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:23,357 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-23 06:30:23,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:23,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:23,568 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-23 06:30:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-07-23 06:30:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:23,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472278125] [2022-07-23 06:30:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:23,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:23,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:23,570 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:23,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 06:30:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:23,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:30:23,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:23,805 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-23 06:30:23,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:23,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:23,880 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-23 06:30:24,270 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-23 06:30:24,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472278125] [2022-07-23 06:30:24,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472278125] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:24,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:24,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-23 06:30:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712167889] [2022-07-23 06:30:24,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:24,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:30:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:30:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:30:24,271 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-23 06:30:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:25,056 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-23 06:30:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:30:25,057 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-23 06:30:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:25,058 INFO L225 Difference]: With dead ends: 143 [2022-07-23 06:30:25,058 INFO L226 Difference]: Without dead ends: 143 [2022-07-23 06:30:25,058 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-23 06:30:25,059 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 24 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:25,059 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.7s Time] [2022-07-23 06:30:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-23 06:30:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-23 06:30:25,062 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-23 06:30:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-23 06:30:25,063 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-07-23 06:30:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:25,063 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-23 06:30:25,063 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-23 06:30:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-23 06:30:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:30:25,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:25,064 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-23 06:30:25,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:25,277 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-23 06:30:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-07-23 06:30:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:25,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290004908] [2022-07-23 06:30:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:25,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:25,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 06:30:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:25,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:30:25,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:25,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:25,470 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-23 06:30:25,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:25,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290004908] [2022-07-23 06:30:25,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290004908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:25,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:25,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416982171] [2022-07-23 06:30:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:25,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:25,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:25,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:25,473 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-23 06:30:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:26,078 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-23 06:30:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:26,078 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-23 06:30:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:26,079 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:30:26,079 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:30:26,080 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-23 06:30:26,080 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-23 06:30:26,081 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-23 06:30:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:30:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-23 06:30:26,084 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-23 06:30:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-23 06:30:26,084 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-07-23 06:30:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:26,085 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-23 06:30:26,085 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-23 06:30:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-23 06:30:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:30:26,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:26,086 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-23 06:30:26,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:26,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:26,297 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-23 06:30:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-07-23 06:30:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:26,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816597219] [2022-07-23 06:30:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:26,299 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:26,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 06:30:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:26,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:30:26,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:26,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:26,563 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-23 06:30:26,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:26,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:26,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816597219] [2022-07-23 06:30:26,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816597219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:26,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:26,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612557174] [2022-07-23 06:30:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:26,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:26,565 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-23 06:30:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:27,249 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-23 06:30:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:27,249 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-23 06:30:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:27,250 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:27,250 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:27,250 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-23 06:30:27,251 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 20 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:27,252 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.6s Time] [2022-07-23 06:30:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-23 06:30:27,255 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-23 06:30:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-23 06:30:27,255 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-07-23 06:30:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:27,256 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-23 06:30:27,256 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-23 06:30:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-23 06:30:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:30:27,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:27,257 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-23 06:30:27,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-23 06:30:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:27,467 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-23 06:30:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-07-23 06:30:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592646526] [2022-07-23 06:30:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:27,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:27,469 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:27,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 06:30:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:27,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:27,653 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-23 06:30:27,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:27,717 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-23 06:30:27,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:27,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592646526] [2022-07-23 06:30:27,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592646526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:27,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:27,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-23 06:30:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481540449] [2022-07-23 06:30:27,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:27,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:27,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:27,719 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-23 06:30:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:27,741 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-23 06:30:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:30:27,742 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-23 06:30:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:27,743 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:30:27,743 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:30:27,743 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-23 06:30:27,744 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-23 06:30:27,744 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-23 06:30:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:30:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 06:30:27,746 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-23 06:30:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-07-23 06:30:27,747 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-07-23 06:30:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:27,748 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-07-23 06:30:27,748 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-23 06:30:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-07-23 06:30:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:30:27,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:27,754 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-23 06:30:27,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:27,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:27,965 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-23 06:30:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-07-23 06:30:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:27,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965801504] [2022-07-23 06:30:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:27,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:27,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:27,968 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:27,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 06:30:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:28,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:30:28,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:28,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:28,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:28,328 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:30:28,328 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-23 06:30:28,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:28,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:28,447 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-23 06:30:28,643 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:30:28,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:30:28,672 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-23 06:30:28,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:28,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:28,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965801504] [2022-07-23 06:30:28,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965801504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:28,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [951241483] [2022-07-23 06:30:28,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:28,982 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:28,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:28,984 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-23 06:30:29,007 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-23 06:30:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:29,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:30:29,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:29,310 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:30:29,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:30:29,351 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:30:29,352 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-23 06:30:29,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:29,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:29,454 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:30:29,454 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-23 06:30:29,558 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:30:29,558 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-23 06:30:29,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:29,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:29,778 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:30:29,778 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-23 06:30:30,154 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:30:30,154 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-23 06:30:30,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:30,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:30,250 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:30:30,250 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-23 06:30:30,378 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-23 06:30:30,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:30,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [951241483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:30,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:30,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2022-07-23 06:30:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231658163] [2022-07-23 06:30:30,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:30,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:30:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:30:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:30:30,475 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-23 06:30:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:33,295 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-07-23 06:30:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:30:33,296 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-23 06:30:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:33,297 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:30:33,297 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:30:33,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:30:33,298 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 17 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:33,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 841 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 514 Unchecked, 0.5s Time] [2022-07-23 06:30:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:30:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:30:33,300 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-23 06:30:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-07-23 06:30:33,301 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 43 [2022-07-23 06:30:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:33,302 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-07-23 06:30:33,302 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-23 06:30:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-07-23 06:30:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:30:33,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:33,304 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-23 06:30:33,311 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-23 06:30:33,517 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-23 06:30:33,708 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-23 06:30:33,709 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-23 06:30:33,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2022-07-23 06:30:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:33,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737329245] [2022-07-23 06:30:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:33,711 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 06:30:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:33,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:30:33,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:34,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:34,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:34,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:34,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:36,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:36,148 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-23 06:30:36,157 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:36,157 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-23 06:30:36,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:38,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:38,304 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-23 06:30:38,578 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:30:38,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:30:38,651 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-23 06:30:38,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:38,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:38,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737329245] [2022-07-23 06:30:38,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737329245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:38,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1132293049] [2022-07-23 06:30:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:38,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:38,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:38,888 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-23 06:30:38,889 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-23 06:30:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:39,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:30:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:39,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:39,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:39,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:39,332 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-23 06:30:39,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:41,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:41,711 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-23 06:30:42,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:30:42,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:42,139 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-23 06:30:42,161 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-23 06:30:42,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1132293049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:50,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:50,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-23 06:30:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820998735] [2022-07-23 06:30:50,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:30:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:30:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=430, Unknown=7, NotChecked=0, Total=506 [2022-07-23 06:30:50,627 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-23 06:30:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:53,627 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-07-23 06:30:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:30:53,628 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-23 06:30:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:53,629 INFO L225 Difference]: With dead ends: 128 [2022-07-23 06:30:53,629 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 06:30:53,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=112, Invalid=692, Unknown=8, NotChecked=0, Total=812 [2022-07-23 06:30:53,630 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 21 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:53,630 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.5s Time] [2022-07-23 06:30:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 06:30:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-23 06:30:53,634 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-23 06:30:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2022-07-23 06:30:53,635 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 43 [2022-07-23 06:30:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:53,635 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2022-07-23 06:30:53,635 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-23 06:30:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-07-23 06:30:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:30:53,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:53,636 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-23 06:30:53,643 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-23 06:30:53,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:54,041 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-23 06:30:54,041 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-23 06:30:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2022-07-23 06:30:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:54,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120881258] [2022-07-23 06:30:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:54,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:54,044 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:54,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 06:30:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:54,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 06:30:54,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:54,221 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-23 06:30:54,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:54,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:54,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120881258] [2022-07-23 06:30:54,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120881258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:54,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:54,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824105221] [2022-07-23 06:30:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:54,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:54,224 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-23 06:30:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:54,432 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-07-23 06:30:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:54,433 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-23 06:30:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:54,433 INFO L225 Difference]: With dead ends: 142 [2022-07-23 06:30:54,433 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 06:30:54,434 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-23 06:30:54,434 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 89 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:54,435 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.2s Time] [2022-07-23 06:30:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 06:30:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-07-23 06:30:54,438 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-23 06:30:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2022-07-23 06:30:54,439 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 45 [2022-07-23 06:30:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:54,439 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2022-07-23 06:30:54,439 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-23 06:30:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-07-23 06:30:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:30:54,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:54,440 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-23 06:30:54,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:54,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:54,648 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-23 06:30:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2022-07-23 06:30:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:54,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889776408] [2022-07-23 06:30:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:54,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:54,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:54,650 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:54,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-23 06:30:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:54,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:54,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:54,904 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-23 06:30:54,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:54,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:54,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889776408] [2022-07-23 06:30:54,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889776408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:54,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:54,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:30:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766325247] [2022-07-23 06:30:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:54,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:30:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:30:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:30:54,906 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-23 06:30:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:55,074 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-07-23 06:30:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:55,075 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-23 06:30:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:55,076 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:30:55,076 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:30:55,076 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-23 06:30:55,077 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-23 06:30:55,077 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-23 06:30:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:30:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 06:30:55,080 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-23 06:30:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2022-07-23 06:30:55,086 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 45 [2022-07-23 06:30:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:55,086 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2022-07-23 06:30:55,087 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-23 06:30:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-07-23 06:30:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:55,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:55,088 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-23 06:30:55,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:55,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:55,296 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-23 06:30:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1119645598, now seen corresponding path program 1 times [2022-07-23 06:30:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623868674] [2022-07-23 06:30:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:55,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:55,298 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:55,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 06:30:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:55,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:30:55,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:55,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:55,578 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-23 06:30:55,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:55,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:55,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623868674] [2022-07-23 06:30:55,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623868674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:55,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:55,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584395055] [2022-07-23 06:30:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:55,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:55,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:55,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:55,580 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-23 06:30:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:56,043 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-07-23 06:30:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:56,043 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-23 06:30:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:56,044 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:56,044 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:56,044 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-23 06:30:56,045 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 82 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:56,045 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.4s Time] [2022-07-23 06:30:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-07-23 06:30:56,047 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-23 06:30:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2022-07-23 06:30:56,048 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 46 [2022-07-23 06:30:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:56,048 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2022-07-23 06:30:56,048 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-23 06:30:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-07-23 06:30:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:56,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:56,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] [2022-07-23 06:30:56,060 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-23 06:30:56,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:56,260 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-23 06:30:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:56,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1119645597, now seen corresponding path program 1 times [2022-07-23 06:30:56,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:56,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96649929] [2022-07-23 06:30:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:56,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:56,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:56,262 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:56,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-23 06:30:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:56,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:30:56,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:56,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:56,530 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-23 06:30:56,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:56,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96649929] [2022-07-23 06:30:56,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96649929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:56,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:56,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759355751] [2022-07-23 06:30:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:56,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:56,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:56,532 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-23 06:30:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:57,009 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-07-23 06:30:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:57,010 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-23 06:30:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:57,010 INFO L225 Difference]: With dead ends: 112 [2022-07-23 06:30:57,010 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 06:30:57,011 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-23 06:30:57,011 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:57,012 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.5s Time] [2022-07-23 06:30:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 06:30:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-23 06:30:57,014 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-23 06:30:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2022-07-23 06:30:57,015 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 46 [2022-07-23 06:30:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:57,015 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2022-07-23 06:30:57,015 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-23 06:30:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2022-07-23 06:30:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:57,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:57,016 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-23 06:30:57,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-23 06:30:57,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:30:57,227 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-23 06:30:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2022-07-23 06:30:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:57,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255465582] [2022-07-23 06:30:57,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:57,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:57,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:57,229 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:30:57,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-23 06:30:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:57,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:30:57,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:57,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:57,784 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 9 treesize of output 5 [2022-07-23 06:30:58,055 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:30:58,055 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 22 treesize of output 33 [2022-07-23 06:30:58,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:58,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 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-23 06:30:58,170 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 27 treesize of output 15 [2022-07-23 06:30:58,217 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-23 06:30:58,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:58,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:58,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255465582] [2022-07-23 06:30:58,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255465582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:58,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1106223381] [2022-07-23 06:30:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:58,391 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:58,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:58,392 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-23 06:30:58,393 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-23 06:30:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:58,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:30:58,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:58,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:59,308 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 9 treesize of output 5 [2022-07-23 06:30:59,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:59,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:30:59,597 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:30:59,597 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 22 treesize of output 33 [2022-07-23 06:30:59,790 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 26 treesize of output 14 [2022-07-23 06:30:59,850 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-23 06:30:59,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:00,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1106223381] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:00,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:00,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-23 06:31:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070734064] [2022-07-23 06:31:00,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:00,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:31:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:31:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=552, Unknown=5, NotChecked=0, Total=650 [2022-07-23 06:31:00,062 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 24 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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-23 06:31:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:01,194 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-23 06:31:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:31:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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-23 06:31:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:01,196 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:31:01,196 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:31:01,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 69 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=153, Invalid=894, Unknown=9, NotChecked=0, Total=1056 [2022-07-23 06:31:01,197 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 20 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:01,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 777 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 473 Invalid, 0 Unknown, 166 Unchecked, 0.8s Time] [2022-07-23 06:31:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:31:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-23 06:31:01,201 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-23 06:31:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2022-07-23 06:31:01,202 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 46 [2022-07-23 06:31:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:01,202 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2022-07-23 06:31:01,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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-23 06:31:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-07-23 06:31:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:31:01,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:01,205 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-23 06:31:01,212 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-23 06:31:01,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-23 06:31:01,611 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-23 06:31:01,611 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-23 06:31:01,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2022-07-23 06:31:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:01,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341176368] [2022-07-23 06:31:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:01,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:01,613 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:01,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-23 06:31:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:01,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:31:01,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:02,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:02,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:02,271 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-23 06:31:02,277 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-23 06:31:02,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-23 06:31:02,372 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-23 06:31:02,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,726 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 25 treesize of output 25 [2022-07-23 06:31:02,744 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:31:02,744 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 16 treesize of output 16 [2022-07-23 06:31:02,755 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-23 06:31:02,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,770 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-23 06:31:02,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 25 treesize of output 13 [2022-07-23 06:31:02,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 15 treesize of output 7 [2022-07-23 06:31:02,976 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-23 06:31:02,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:03,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:03,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341176368] [2022-07-23 06:31:03,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341176368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:03,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929357379] [2022-07-23 06:31:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:03,477 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:03,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:03,480 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-23 06:31:03,481 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-23 06:31:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:03,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-23 06:31:03,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:04,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-23 06:31:04,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:04,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-23 06:31:04,590 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-23 06:31:04,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:04,892 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-23 06:31:04,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:04,907 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 25 treesize of output 25 [2022-07-23 06:31:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:04,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:31:04,938 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:31:04,939 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 16 treesize of output 16 [2022-07-23 06:31:05,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:31:05,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:31:05,144 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-23 06:31:05,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:05,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929357379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:05,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:05,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2022-07-23 06:31:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799571628] [2022-07-23 06:31:05,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:05,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 06:31:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:05,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 06:31:05,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=814, Unknown=4, NotChecked=0, Total=930 [2022-07-23 06:31:05,735 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-23 06:31:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:07,246 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-07-23 06:31:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:31:07,247 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-23 06:31:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:07,247 INFO L225 Difference]: With dead ends: 110 [2022-07-23 06:31:07,247 INFO L226 Difference]: Without dead ends: 110 [2022-07-23 06:31:07,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=183, Invalid=1291, Unknown=8, NotChecked=0, Total=1482 [2022-07-23 06:31:07,249 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:07,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 601 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 525 Invalid, 0 Unknown, 114 Unchecked, 1.0s Time] [2022-07-23 06:31:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-23 06:31:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-23 06:31:07,252 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-23 06:31:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-07-23 06:31:07,252 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 46 [2022-07-23 06:31:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:07,253 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-07-23 06:31:07,253 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-23 06:31:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-07-23 06:31:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 06:31:07,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:07,254 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-23 06:31:07,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-07-23 06:31:07,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:07,660 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-23 06:31:07,660 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-23 06:31:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -645963432, now seen corresponding path program 1 times [2022-07-23 06:31:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:07,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478984895] [2022-07-23 06:31:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:07,662 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:07,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-23 06:31:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:07,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:31:07,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:07,912 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-23 06:31:07,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:31:07,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:07,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478984895] [2022-07-23 06:31:07,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478984895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:07,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:07,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:31:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196409296] [2022-07-23 06:31:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:07,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:31:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:07,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:31:07,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:31:07,914 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-23 06:31:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:08,086 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2022-07-23 06:31:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:31:08,086 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-23 06:31:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:08,087 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:31:08,087 INFO L226 Difference]: Without dead ends: 125 [2022-07-23 06:31:08,087 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-23 06:31:08,088 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-23 06:31:08,088 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-23 06:31:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-23 06:31:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-23 06:31:08,091 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-23 06:31:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-07-23 06:31:08,092 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 49 [2022-07-23 06:31:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:08,092 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-07-23 06:31:08,092 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-23 06:31:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-07-23 06:31:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 06:31:08,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:08,093 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-23 06:31:08,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:08,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:31:08,294 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-23 06:31:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -645963431, now seen corresponding path program 1 times [2022-07-23 06:31:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:08,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218413590] [2022-07-23 06:31:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:08,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:08,296 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:08,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-23 06:31:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:08,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:31:08,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:08,627 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-23 06:31:08,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:31:08,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:08,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218413590] [2022-07-23 06:31:08,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218413590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:08,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:08,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:31:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239364516] [2022-07-23 06:31:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:08,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:31:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:08,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:31:08,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:31:08,629 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-23 06:31:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:08,839 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-23 06:31:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:31:08,840 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-23 06:31:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:08,840 INFO L225 Difference]: With dead ends: 104 [2022-07-23 06:31:08,841 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:31:08,841 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-23 06:31:08,841 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 215 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:31:08,841 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-23 06:31:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:31:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-23 06:31:08,848 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-23 06:31:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2022-07-23 06:31:08,849 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 49 [2022-07-23 06:31:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:08,849 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2022-07-23 06:31:08,850 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-23 06:31:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-07-23 06:31:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 06:31:08,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:08,852 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-23 06:31:08,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:09,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:31:09,064 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-23 06:31:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1999401721, now seen corresponding path program 1 times [2022-07-23 06:31:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:09,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349888545] [2022-07-23 06:31:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:09,066 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:09,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-23 06:31:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:09,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:31:09,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:09,682 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-23 06:31:09,750 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-23 06:31:10,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:10,034 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-23 06:31:10,108 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-23 06:31:10,134 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-23 06:31:10,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:10,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349888545] [2022-07-23 06:31:10,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349888545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2071492251] [2022-07-23 06:31:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:10,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:10,328 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:31:10,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-07-23 06:31:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:10,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 06:31:10,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:11,180 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-23 06:31:11,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:11,628 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-23 06:31:11,703 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-23 06:31:11,710 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-23 06:31:11,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:11,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2071492251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:11,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:11,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-07-23 06:31:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809072509] [2022-07-23 06:31:11,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:11,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 06:31:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:11,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 06:31:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=963, Unknown=70, NotChecked=0, Total=1190 [2022-07-23 06:31:11,826 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-23 06:31:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:12,783 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-07-23 06:31:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:31:12,784 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-23 06:31:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:12,784 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:31:12,784 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:31:12,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=260, Invalid=1542, Unknown=90, NotChecked=0, Total=1892 [2022-07-23 06:31:12,786 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 30 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:12,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1058 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2022-07-23 06:31:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:31:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-23 06:31:12,788 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-23 06:31:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-23 06:31:12,789 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 51 [2022-07-23 06:31:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:12,789 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-23 06:31:12,790 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-23 06:31:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-23 06:31:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:31:12,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:12,790 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-23 06:31:12,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:13,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2022-07-23 06:31:13,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:13,196 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-23 06:31:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1685641326, now seen corresponding path program 1 times [2022-07-23 06:31:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:13,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931071761] [2022-07-23 06:31:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:13,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:13,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:13,198 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:13,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-23 06:31:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:13,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:31:13,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:13,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:31:13,479 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-23 06:31:13,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:31:13,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931071761] [2022-07-23 06:31:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931071761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:13,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:31:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854324713] [2022-07-23 06:31:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:13,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:31:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:31:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:31:13,482 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-23 06:31:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:13,878 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2022-07-23 06:31:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:31:13,878 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-23 06:31:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:13,879 INFO L225 Difference]: With dead ends: 118 [2022-07-23 06:31:13,879 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 06:31:13,879 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-23 06:31:13,879 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-23 06:31:13,880 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-23 06:31:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 06:31:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-07-23 06:31:13,882 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-23 06:31:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-07-23 06:31:13,882 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 52 [2022-07-23 06:31:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:13,883 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-07-23 06:31:13,883 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-23 06:31:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-07-23 06:31:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:31:13,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:13,884 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-23 06:31:13,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:14,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:31:14,087 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-23 06:31:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1685641325, now seen corresponding path program 1 times [2022-07-23 06:31:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:14,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216373900] [2022-07-23 06:31:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:14,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:14,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:14,090 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:14,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-23 06:31:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:14,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:31:14,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:14,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-23 06:31:14,412 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-23 06:31:14,522 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-23 06:31:14,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:31:14,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:14,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216373900] [2022-07-23 06:31:14,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216373900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:14,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:14,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:31:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623016025] [2022-07-23 06:31:14,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:14,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:31:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:14,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:31:14,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:31:14,524 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-23 06:31:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:15,256 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-07-23 06:31:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:31:15,257 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-23 06:31:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:15,258 INFO L225 Difference]: With dead ends: 99 [2022-07-23 06:31:15,258 INFO L226 Difference]: Without dead ends: 99 [2022-07-23 06:31:15,258 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-23 06:31:15,258 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:15,258 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.6s Time] [2022-07-23 06:31:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-23 06:31:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-23 06:31:15,261 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-23 06:31:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-07-23 06:31:15,261 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 52 [2022-07-23 06:31:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:15,262 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-07-23 06:31:15,262 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-23 06:31:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-07-23 06:31:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 06:31:15,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:15,263 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-23 06:31:15,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-23 06:31:15,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:31:15,475 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-23 06:31:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash -715273504, now seen corresponding path program 1 times [2022-07-23 06:31:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:15,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178636096] [2022-07-23 06:31:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:15,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:15,477 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-23 06:31:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:15,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 06:31:15,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:16,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:16,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:16,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:16,438 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 23 treesize of output 26 [2022-07-23 06:31:16,446 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-23 06:31:16,456 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:31:16,459 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 7 [2022-07-23 06:31:16,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:16,876 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:16,877 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 29 treesize of output 35 [2022-07-23 06:31:16,958 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-23 06:31:16,958 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 35 treesize of output 64 [2022-07-23 06:31:16,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:16,973 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-23 06:31:17,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:31:17,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:17,281 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 58 treesize of output 41 [2022-07-23 06:31:17,412 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-23 06:31:17,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:17,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:17,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178636096] [2022-07-23 06:31:17,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178636096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:17,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299593390] [2022-07-23 06:31:17,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:17,816 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:17,817 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-23 06:31:17,818 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-23 06:31:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:18,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-23 06:31:18,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:18,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:19,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:19,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:19,507 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 23 treesize of output 14 [2022-07-23 06:31:19,513 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-23 06:31:19,908 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-23 06:31:19,908 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 35 treesize of output 64 [2022-07-23 06:31:19,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,923 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-23 06:31:19,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:19,949 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:19,949 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 53 treesize of output 51 [2022-07-23 06:31:20,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:20,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:20,504 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:31:20,504 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 64 treesize of output 35 [2022-07-23 06:31:20,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:31:21,073 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-23 06:31:21,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:21,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1299593390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:21,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:21,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2022-07-23 06:31:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258710301] [2022-07-23 06:31:21,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:21,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 06:31:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 06:31:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1632, Unknown=7, NotChecked=0, Total=1806 [2022-07-23 06:31:21,373 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-23 06:31:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:23,301 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-23 06:31:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:31:23,302 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-23 06:31:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:23,303 INFO L225 Difference]: With dead ends: 116 [2022-07-23 06:31:23,303 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 06:31:23,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=266, Invalid=2479, Unknown=11, NotChecked=0, Total=2756 [2022-07-23 06:31:23,304 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:23,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 945 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 767 Invalid, 0 Unknown, 216 Unchecked, 1.3s Time] [2022-07-23 06:31:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 06:31:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-07-23 06:31:23,306 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-23 06:31:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-23 06:31:23,307 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 53 [2022-07-23 06:31:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:23,307 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-23 06:31:23,307 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-23 06:31:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-23 06:31:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 06:31:23,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:23,308 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-23 06:31:23,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:23,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-07-23 06:31:23,722 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-23 06:31:23,722 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-23 06:31:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -715273503, now seen corresponding path program 1 times [2022-07-23 06:31:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:23,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811205243] [2022-07-23 06:31:23,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:23,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:23,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:23,724 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:23,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-23 06:31:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:24,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-23 06:31:24,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:24,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:24,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:24,555 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:24,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:31:24,586 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:31:24,586 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-23 06:31:24,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:24,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:25,128 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-23 06:31:25,128 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 65 treesize of output 41 [2022-07-23 06:31:25,140 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:25,141 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-23 06:31:25,149 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-23 06:31:25,155 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 13 treesize of output 9 [2022-07-23 06:31:25,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:25,593 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:25,593 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 71 treesize of output 61 [2022-07-23 06:31:25,624 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-23 06:31:25,624 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 31 treesize of output 33 [2022-07-23 06:31:25,644 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-23 06:31:25,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:25,663 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:25,663 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-23 06:31:26,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:26,149 INFO L356 Elim1Store]: treesize reduction 15, result has 55.9 percent of original size [2022-07-23 06:31:26,150 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-23 06:31:26,175 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-23 06:31:26,175 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-23 06:31:26,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-23 06:31:26,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:29,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811205243] [2022-07-23 06:31:29,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811205243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [182632829] [2022-07-23 06:31:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:29,546 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-23 06:31:29,547 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-23 06:31:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:30,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-23 06:31:30,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:30,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:30,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:30,835 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:31:30,835 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-23 06:31:30,852 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-23 06:31:31,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:31,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:32,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:32,066 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 69 treesize of output 36 [2022-07-23 06:31:32,073 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 17 treesize of output 13 [2022-07-23 06:31:32,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:32,083 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-23 06:31:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:32,862 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:32,862 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 75 treesize of output 65 [2022-07-23 06:31:32,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:32,873 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-23 06:31:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:32,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:32,890 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:32,890 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-23 06:31:32,933 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-23 06:31:32,934 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 35 treesize of output 37 [2022-07-23 06:31:33,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:33,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:34,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:34,007 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-23 06:31:34,041 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-23 06:31:34,041 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-23 06:31:34,488 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-23 06:31:34,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [182632829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:35,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:35,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 44 [2022-07-23 06:31:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489407311] [2022-07-23 06:31:35,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:35,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 06:31:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 06:31:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2331, Unknown=11, NotChecked=0, Total=2550 [2022-07-23 06:31:35,632 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-23 06:31:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:39,430 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-23 06:31:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:31:39,430 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-23 06:31:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:39,431 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:31:39,431 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:31:39,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=339, Invalid=3802, Unknown=19, NotChecked=0, Total=4160 [2022-07-23 06:31:39,432 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:39,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1093 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 666 Invalid, 0 Unknown, 314 Unchecked, 1.5s Time] [2022-07-23 06:31:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:31:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-23 06:31:39,435 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-23 06:31:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-07-23 06:31:39,435 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 53 [2022-07-23 06:31:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:39,436 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-07-23 06:31:39,436 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-23 06:31:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-07-23 06:31:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:31:39,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:39,437 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-23 06:31:39,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:39,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-23 06:31:39,845 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-23 06:31:39,845 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-23 06:31:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash 821274967, now seen corresponding path program 1 times [2022-07-23 06:31:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:39,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714256191] [2022-07-23 06:31:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:39,847 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:31:39,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-23 06:31:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:40,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-23 06:31:40,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:40,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:40,475 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-23 06:31:40,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:40,507 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-23 06:31:40,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:40,628 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-23 06:31:40,629 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-23 06:31:40,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:41,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:41,693 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:41,694 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 29 treesize of output 16 [2022-07-23 06:31:41,700 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-23 06:31:41,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:31:42,361 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:42,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:31:42,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:31:42,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:42,432 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:42,433 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 35 treesize of output 39 [2022-07-23 06:31:42,503 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:31:42,504 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 22 treesize of output 33 [2022-07-23 06:31:42,992 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-23 06:31:43,960 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-23 06:31:43,960 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-23 06:31:44,229 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-23 06:31:44,230 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-23 06:31:44,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:31:44,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:44,436 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-23 06:31:44,447 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-23 06:31:44,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:31:44,912 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:44,913 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-23 06:31:47,326 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-23 06:31:47,655 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-23 06:31:47,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:48,530 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 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3062) |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-23 06:31:48,548 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 (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_3062) |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-23 06:31:51,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:51,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714256191] [2022-07-23 06:31:51,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714256191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:51,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [497859628] [2022-07-23 06:31:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:51,917 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-23 06:31:51,918 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-23 06:31:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:52,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-23 06:31:52,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:53,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:31:54,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:55,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:55,857 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 28 treesize of output 15 [2022-07-23 06:31:55,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:31:55,870 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-23 06:31:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:56,366 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:56,366 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 34 treesize of output 38 [2022-07-23 06:31:56,411 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:31:56,412 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 22 treesize of output 33 [2022-07-23 06:31:56,491 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:56,491 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-23 06:31:56,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:00,421 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-23 06:32:02,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:02,061 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-23 06:32:02,659 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-23 06:32:02,659 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-23 06:32:02,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:03,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:03,400 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-23 06:32:03,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:03,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:03,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:32:04,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:04,312 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-23 06:32:05,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-23 06:32:05,259 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-23 06:32:05,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:05,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3209) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 06:32:05,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3209 (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_3207) |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_3209) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 06:32:07,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3206 (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_3206) (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) v_ArrVal_3207)) |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_3209) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 06:32:07,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3206 (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_3206) (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) v_ArrVal_3207)) (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_3208) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3209) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-23 06:32:10,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [497859628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:10,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:32:10,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 58 [2022-07-23 06:32:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792334243] [2022-07-23 06:32:10,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:10,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-23 06:32:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:32:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-23 06:32:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=5758, Unknown=141, NotChecked=966, Total=7310 [2022-07-23 06:32:10,144 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-23 06:32:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:15,852 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-07-23 06:32:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 06:32:15,853 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-23 06:32:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:15,853 INFO L225 Difference]: With dead ends: 104 [2022-07-23 06:32:15,853 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:32:15,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 101 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2893 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=629, Invalid=8561, Unknown=146, NotChecked=1170, Total=10506 [2022-07-23 06:32:15,856 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1268 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 655 Invalid, 0 Unknown, 502 Unchecked, 1.9s Time] [2022-07-23 06:32:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:32:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-23 06:32:15,859 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-23 06:32:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-07-23 06:32:15,860 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 58 [2022-07-23 06:32:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:15,860 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-07-23 06:32:15,860 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-23 06:32:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-07-23 06:32:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:32:15,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:15,861 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-23 06:32:15,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-23 06:32:16,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-07-23 06:32:16,267 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-23 06:32:16,268 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-23 06:32:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 821274968, now seen corresponding path program 1 times [2022-07-23 06:32:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:32:16,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909627857] [2022-07-23 06:32:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:16,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:32:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:32:16,270 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-23 06:32:16,272 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-23 06:32:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:16,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-23 06:32:16,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:16,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:32:16,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:16,987 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:16,988 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-23 06:32:17,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:32:17,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:32:17,943 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:32:17,943 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 29 treesize of output 16 [2022-07-23 06:32:17,951 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-23 06:32:17,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:18,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:32:18,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:18,797 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:32:18,798 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 35 treesize of output 39 [2022-07-23 06:32:18,824 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:32:18,825 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 16 treesize of output 16 [2022-07-23 06:32:18,898 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:32:18,898 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-23 06:32:18,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:20,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:20,804 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-07-23 06:32:20,804 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-23 06:32:20,814 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-23 06:32:21,050 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:32:21,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:32:21,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:21,105 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-23 06:32:21,106 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-23 06:32:21,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:32:21,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:21,289 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-23 06:32:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:21,307 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-23 06:32:21,316 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-23 06:32:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:32:21,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:32:21,710 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:21,711 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-23 06:32:21,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:21,724 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-23 06:32:21,955 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-23 06:32:21,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:32:22,303 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-23 06:32:22,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:22,937 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-23 06:32:22,972 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-23 06:32:23,321 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-23 06:32:25,358 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-23 06:32:27,829 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-23 06:32:28,010 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-23 06:32:28,436 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-23 06:32:28,634 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-23 06:32:28,872 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 ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (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))))) (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) .cse1 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) .cse0 v_ArrVal_3355) .cse1 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 ((.cse3 (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) (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_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) .cse3) (bvadd .cse3 (_ bv12 32)))))) is different from false [2022-07-23 06:32:29,065 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-23 06:32:32,054 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-23 06:32:34,908 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 450 treesize of output 388 [2022-07-23 06:32:45,439 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:32:45,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:32:45,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909627857] [2022-07-23 06:32:45,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909627857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:45,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097238724] [2022-07-23 06:32:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:32:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:32:45,443 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-23 06:32:45,445 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-23 06:32:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:46,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-23 06:32:46,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:58,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:33:13,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:33:20,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:33:20,826 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 28 treesize of output 15 [2022-07-23 06:33:20,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:33:20,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:33:21,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:33:27,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:33:27,614 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:33:27,614 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 34 treesize of output 38 [2022-07-23 06:33:27,970 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:33:27,970 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 16 treesize of output 16 [2022-07-23 06:33:28,948 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:33:28,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, 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-23 06:33:29,078 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