./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.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_equal.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:29:44,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:29:44,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:29:44,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:29:44,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:29:44,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:29:44,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:29:44,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:29:44,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:29:44,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:29:44,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:29:44,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:29:44,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:29:44,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:29:44,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:29:44,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:29:44,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:29:44,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:29:44,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:29:44,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:29:44,583 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:29:44,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:29:44,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:29:44,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:29:44,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:29:44,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:29:44,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:29:44,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:29:44,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:29:44,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:29:44,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:29:44,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:29:44,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:29:44,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:29:44,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:29:44,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:29:44,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:29:44,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:29:44,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:29:44,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:29:44,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:29:44,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:29:44,597 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:44,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:29:44,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:29:44,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:29:44,625 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:29:44,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:29:44,626 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:29:44,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:29:44,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:29:44,627 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:29:44,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:29:44,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:29:44,628 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:29:44,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:29:44,629 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:29:44,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:29:44,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:29:44,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:29:44,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:29:44,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:29:44,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:29:44,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:29:44,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:29:44,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:29:44,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:29:44,631 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2022-07-23 06:29:44,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:29:44,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:29:44,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:29:44,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:29:44,878 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:29:44,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-07-23 06:29:44,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1225e7983/a6a27dc4a3e54c69954a9557531c0f78/FLAGecf00ed17 [2022-07-23 06:29:45,350 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:29:45,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-07-23 06:29:45,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1225e7983/a6a27dc4a3e54c69954a9557531c0f78/FLAGecf00ed17 [2022-07-23 06:29:45,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1225e7983/a6a27dc4a3e54c69954a9557531c0f78 [2022-07-23 06:29:45,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:29:45,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:29:45,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:29:45,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:29:45,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:29:45,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:29:45" (1/1) ... [2022-07-23 06:29:45,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16515d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:45, skipping insertion in model container [2022-07-23 06:29:45,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:29:45" (1/1) ... [2022-07-23 06:29:45,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:29:45,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:29:45,647 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_equal.i[24640,24653] [2022-07-23 06:29:45,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:29:45,659 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:29:45,695 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_equal.i[24640,24653] [2022-07-23 06:29:45,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:29:45,729 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:29:45,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:45 WrapperNode [2022-07-23 06:29:45,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:29:45,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:29:45,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:29:45,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:29:45,738 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:45" (1/1) ... [2022-07-23 06:29:45,763 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:45" (1/1) ... [2022-07-23 06:29:45,790 INFO L137 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2022-07-23 06:29:45,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:29:45,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:29:45,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:29:45,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:29:45,797 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:45" (1/1) ... [2022-07-23 06:29:45,798 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:45" (1/1) ... [2022-07-23 06:29:45,812 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:45" (1/1) ... [2022-07-23 06:29:45,813 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:45" (1/1) ... [2022-07-23 06:29:45,822 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:45" (1/1) ... [2022-07-23 06:29:45,830 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:45" (1/1) ... [2022-07-23 06:29:45,832 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:45" (1/1) ... [2022-07-23 06:29:45,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:29:45,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:29:45,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:29:45,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:29:45,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:45" (1/1) ... [2022-07-23 06:29:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:29:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:45,873 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:45,882 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:45,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:29:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:29:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:29:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:29:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:29:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:29:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:29:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:29:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:29:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:29:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:29:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:29:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:29:45,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:29:46,006 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:29:46,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:29:46,326 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:29:46,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:29:46,331 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:29:46,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:29:46 BoogieIcfgContainer [2022-07-23 06:29:46,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:29:46,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:29:46,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:29:46,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:29:46,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:29:45" (1/3) ... [2022-07-23 06:29:46,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:29:46, skipping insertion in model container [2022-07-23 06:29:46,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:45" (2/3) ... [2022-07-23 06:29:46,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:29:46, skipping insertion in model container [2022-07-23 06:29:46,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:29:46" (3/3) ... [2022-07-23 06:29:46,356 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2022-07-23 06:29:46,367 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:29:46,368 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-07-23 06:29:46,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:29:46,453 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@603e3b13, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14ac8d71 [2022-07-23 06:29:46,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-07-23 06:29:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 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:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:29:46,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:46,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:29:46,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2022-07-23 06:29:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:46,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818123425] [2022-07-23 06:29:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:46,790 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:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818123425] [2022-07-23 06:29:46,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818123425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:46,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:46,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:29:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11366777] [2022-07-23 06:29:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:46,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:29:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:46,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:29:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:29:46,828 INFO L87 Difference]: Start difference. First operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 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:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:46,956 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-07-23 06:29:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:29:46,958 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:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:46,963 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:29:46,964 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:29:46,965 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:46,967 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:46,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:29:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:29:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 06:29:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 63 states have (on average 2.0) internal successors, (126), 119 states have internal predecessors, (126), 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:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-23 06:29:47,005 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2022-07-23 06:29:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:47,005 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-23 06:29:47,005 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:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-23 06:29:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:29:47,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:47,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:29:47,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:29:47,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2022-07-23 06:29:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:47,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083607821] [2022-07-23 06:29:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,043 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:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:47,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083607821] [2022-07-23 06:29:47,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083607821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:47,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:47,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:29:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975599618] [2022-07-23 06:29:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:47,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:29:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:29:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:29:47,046 INFO L87 Difference]: Start difference. First operand 124 states and 132 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:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:47,112 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-07-23 06:29:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:29:47,113 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:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:47,114 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:29:47,114 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:29:47,114 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:47,115 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:47,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:29:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:29:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:29:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 116 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:29:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-23 06:29:47,122 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2022-07-23 06:29:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:47,123 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-23 06:29:47,123 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:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-23 06:29:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:29:47,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:47,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:29:47,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:29:47,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2022-07-23 06:29:47,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:47,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671948220] [2022-07-23 06:29:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,232 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:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671948220] [2022-07-23 06:29:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671948220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:47,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:29:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640044045] [2022-07-23 06:29:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:29:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:29:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:29:47,234 INFO L87 Difference]: Start difference. First operand 121 states and 129 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:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:47,371 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-23 06:29:47,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:29:47,372 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:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:47,377 INFO L225 Difference]: With dead ends: 132 [2022-07-23 06:29:47,377 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:29:47,378 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:47,379 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:47,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:29:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:29:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2022-07-23 06:29:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-07-23 06:29:47,391 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2022-07-23 06:29:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:47,392 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-07-23 06:29:47,398 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:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-07-23 06:29:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:29:47,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:47,400 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:47,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:29:47,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2022-07-23 06:29:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:47,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111869629] [2022-07-23 06:29:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,591 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:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:47,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111869629] [2022-07-23 06:29:47,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111869629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:47,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:47,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:29:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912198343] [2022-07-23 06:29:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:47,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:29:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:29:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:29:47,594 INFO L87 Difference]: Start difference. First operand 122 states and 130 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:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:47,798 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-07-23 06:29:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:47,799 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:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:47,800 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:29:47,801 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:29:47,801 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:47,802 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:47,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:29:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:29:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-23 06:29:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.921875) internal successors, (123), 116 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:29:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-23 06:29:47,807 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-07-23 06:29:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:47,808 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-23 06:29:47,808 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:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-23 06:29:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:29:47,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:47,809 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:47,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:29:47,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2022-07-23 06:29:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:47,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846476405] [2022-07-23 06:29:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:47,962 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:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:47,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846476405] [2022-07-23 06:29:47,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846476405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:47,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:47,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:29:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830125903] [2022-07-23 06:29:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:47,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:29:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:29:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:29:47,965 INFO L87 Difference]: Start difference. First operand 121 states and 129 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:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:48,148 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-07-23 06:29:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:48,156 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:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:48,157 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:29:48,157 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:29:48,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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:48,158 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 19 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:48,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 418 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:29:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:29:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-07-23 06:29:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.90625) internal successors, (122), 115 states have internal predecessors, (122), 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:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-23 06:29:48,171 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2022-07-23 06:29:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:48,172 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-23 06:29:48,172 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:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-23 06:29:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:29:48,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:48,173 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:48,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:29:48,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:48,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2022-07-23 06:29:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:48,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805674232] [2022-07-23 06:29:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:48,312 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:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:48,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805674232] [2022-07-23 06:29:48,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805674232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:48,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353846264] [2022-07-23 06:29:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:48,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:48,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:48,315 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:48,340 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:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:48,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:29:48,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:48,508 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:48,673 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:29:48,674 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:48,686 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:48,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:48,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353846264] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:48,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:29:48,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-23 06:29:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448753951] [2022-07-23 06:29:48,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:48,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:29:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:29:48,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:29:48,740 INFO L87 Difference]: Start difference. First operand 120 states and 128 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:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:48,983 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-07-23 06:29:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:48,983 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:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:48,984 INFO L225 Difference]: With dead ends: 145 [2022-07-23 06:29:48,984 INFO L226 Difference]: Without dead ends: 145 [2022-07-23 06:29:48,984 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:48,985 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 102 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:48,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 414 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-23 06:29:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-23 06:29:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2022-07-23 06:29:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 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:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-07-23 06:29:48,989 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 26 [2022-07-23 06:29:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:48,990 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-07-23 06:29:48,990 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:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-07-23 06:29:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:29:48,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:48,990 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:49,047 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:49,191 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:49,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2022-07-23 06:29:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738319184] [2022-07-23 06:29:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:49,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:49,423 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:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:49,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738319184] [2022-07-23 06:29:49,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738319184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026843275] [2022-07-23 06:29:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:49,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:49,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:49,438 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:49,498 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:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:49,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:29:49,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:49,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:29:49,580 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:49,745 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-23 06:29:49,745 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 13 [2022-07-23 06:29:49,757 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:29:49,758 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:49,804 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:49,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026843275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:52,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:29:52,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-23 06:29:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364702433] [2022-07-23 06:29:52,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:52,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:29:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:29:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:29:52,017 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:52,489 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-23 06:29:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:29:52,490 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:52,490 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:29:52,491 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:29:52,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:29:52,491 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 16 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:52,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 600 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:29:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:29:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-23 06:29:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 119 states have internal predecessors, (127), 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:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-23 06:29:52,495 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 26 [2022-07-23 06:29:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:52,496 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-23 06:29:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-23 06:29:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:29:52,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:52,496 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:52,529 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:52,705 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:52,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2022-07-23 06:29:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:52,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885555755] [2022-07-23 06:29:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,775 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:52,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885555755] [2022-07-23 06:29:52,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885555755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065116012] [2022-07-23 06:29:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:52,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:52,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:52,777 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:52,778 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:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:52,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:29:52,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:52,914 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:52,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:52,965 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:52,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065116012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:29:52,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:29:52,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-23 06:29:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32846810] [2022-07-23 06:29:52,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:29:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:29:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:29:52,968 INFO L87 Difference]: Start difference. First operand 125 states and 135 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:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:53,109 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-23 06:29:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:53,110 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:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:53,112 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:29:53,112 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:29:53,112 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:53,113 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:53,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 612 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:29:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:29:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-07-23 06:29:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 119 states have internal predecessors, (126), 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,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2022-07-23 06:29:53,130 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 28 [2022-07-23 06:29:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:53,130 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2022-07-23 06:29:53,130 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:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2022-07-23 06:29:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:29:53,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:53,133 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:53,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-23 06:29:53,339 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:53,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2022-07-23 06:29:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67332920] [2022-07-23 06:29:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,396 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:53,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:53,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67332920] [2022-07-23 06:29:53,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67332920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:53,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035997371] [2022-07-23 06:29:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:53,412 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:53,421 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:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:29:53,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:53,534 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:53,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:53,542 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:29:53,543 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:53,563 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:53,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035997371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:29:53,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:29:53,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-23 06:29:53,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844384928] [2022-07-23 06:29:53,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:53,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:29:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:53,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:29:53,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:29:53,565 INFO L87 Difference]: Start difference. First operand 125 states and 134 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:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:53,712 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-23 06:29:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:29:53,712 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:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:53,713 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:29:53,713 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:29:53,713 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:53,714 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 13 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:53,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 289 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:29:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:29:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2022-07-23 06:29:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 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,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-07-23 06:29:53,718 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 29 [2022-07-23 06:29:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:53,718 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-07-23 06:29:53,718 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:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-07-23 06:29:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:29:53,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:53,719 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:53,759 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:53,927 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:53,927 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2022-07-23 06:29:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779523605] [2022-07-23 06:29:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:54,045 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:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779523605] [2022-07-23 06:29:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779523605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960543320] [2022-07-23 06:29:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:54,050 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:54,052 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:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:54,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:29:54,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:54,265 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:54,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:29:54,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:29:54,289 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:54,368 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:54,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960543320] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:29:54,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:29:54,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-23 06:29:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906146452] [2022-07-23 06:29:54,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:29:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:29:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:29:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:29:54,370 INFO L87 Difference]: Start difference. First operand 128 states and 139 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:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:54,578 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-07-23 06:29:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:29:54,579 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:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:54,580 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:29:54,580 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:29:54,580 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:54,580 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 33 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:54,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1200 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:29:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:29:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-07-23 06:29:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 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:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-07-23 06:29:54,583 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 29 [2022-07-23 06:29:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:54,583 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-07-23 06:29:54,584 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:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-07-23 06:29:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:29:54,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:54,584 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:54,615 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:54,791 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:54,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2022-07-23 06:29:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:54,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897018672] [2022-07-23 06:29:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:54,853 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:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897018672] [2022-07-23 06:29:54,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897018672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:54,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:54,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:29:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893544879] [2022-07-23 06:29:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:54,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:29:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:29:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:29:54,856 INFO L87 Difference]: Start difference. First operand 128 states and 138 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:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:55,094 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-07-23 06:29:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:29:55,095 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:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:55,095 INFO L225 Difference]: With dead ends: 128 [2022-07-23 06:29:55,095 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 06:29:55,096 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:55,096 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:55,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 438 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:29:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 06:29:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-23 06:29:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 121 states have internal predecessors, (129), 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:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-07-23 06:29:55,098 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2022-07-23 06:29:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:55,099 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-07-23 06:29:55,099 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:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-07-23 06:29:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:29:55,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:55,099 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:55,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:29:55,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2022-07-23 06:29:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:55,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752105435] [2022-07-23 06:29:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,190 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:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:55,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752105435] [2022-07-23 06:29:55,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752105435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:55,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:29:55,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:29:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995370037] [2022-07-23 06:29:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:29:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:29:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:29:55,192 INFO L87 Difference]: Start difference. First operand 127 states and 137 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:29:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:55,407 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-07-23 06:29:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:29:55,407 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:29:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:55,408 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:29:55,408 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:29:55,408 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:29:55,409 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 20 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:55,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:29:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:29:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-23 06:29:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 120 states have internal predecessors, (128), 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:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-07-23 06:29:55,411 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 30 [2022-07-23 06:29:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:55,411 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-07-23 06:29:55,411 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:29:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-07-23 06:29:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:29:55,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:55,412 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:29:55,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:29:55,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2022-07-23 06:29:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576237274] [2022-07-23 06:29:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 06:29:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,470 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:29:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:55,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576237274] [2022-07-23 06:29:55,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576237274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:55,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085160209] [2022-07-23 06:29:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:55,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:55,484 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:29:55,512 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:29:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:29:55,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:55,675 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:29:55,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:29:55,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085160209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:29:55,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:29:55,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-23 06:29:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796411791] [2022-07-23 06:29:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:29:55,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:29:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:29:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:29:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:29:55,678 INFO L87 Difference]: Start difference. First operand 126 states and 136 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:29:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:29:55,702 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-23 06:29:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:29:55,703 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:29:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:29:55,703 INFO L225 Difference]: With dead ends: 114 [2022-07-23 06:29:55,704 INFO L226 Difference]: Without dead ends: 114 [2022-07-23 06:29:55,704 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:29:55,704 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 196 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:29:55,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 133 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:29:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-23 06:29:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-23 06:29:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.78125) internal successors, (114), 109 states have internal predecessors, (114), 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:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-07-23 06:29:55,708 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 41 [2022-07-23 06:29:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:29:55,708 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-07-23 06:29:55,708 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:29:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-07-23 06:29:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:29:55,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:29:55,711 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:29:55,731 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:29:55,916 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:29:55,917 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:29:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:29:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2022-07-23 06:29:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:29:55,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708237577] [2022-07-23 06:29:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:29:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:29:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 06:29:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 06:29:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:56,106 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:29:56,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:29:56,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708237577] [2022-07-23 06:29:56,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708237577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:29:56,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960635146] [2022-07-23 06:29:56,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:29:56,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:29:56,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:29:56,109 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:29:56,111 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:29:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:29:56,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:29:56,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:29:56,270 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:56,277 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:29:56,397 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-23 06:29:56,416 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:29:56,613 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:29:56,613 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 87707 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:29:56,617 INFO L158 Benchmark]: Toolchain (without parser) took 11230.49ms. Allocated memory was 86.0MB in the beginning and 153.1MB in the end (delta: 67.1MB). Free memory was 46.1MB in the beginning and 62.7MB in the end (delta: -16.6MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-07-23 06:29:56,617 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:29:56,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.58ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 45.9MB in the beginning and 89.1MB in the end (delta: -43.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-23 06:29:56,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.72ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 86.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 06:29:56,617 INFO L158 Benchmark]: Boogie Preprocessor took 50.34ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 85.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:29:56,618 INFO L158 Benchmark]: RCFGBuilder took 490.80ms. Allocated memory is still 119.5MB. Free memory was 85.0MB in the beginning and 63.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-23 06:29:56,618 INFO L158 Benchmark]: TraceAbstraction took 10282.55ms. Allocated memory was 119.5MB in the beginning and 153.1MB in the end (delta: 33.6MB). Free memory was 62.5MB in the beginning and 62.7MB in the end (delta: -208.6kB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-07-23 06:29:56,619 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.14ms. Allocated memory is still 86.0MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.58ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 45.9MB in the beginning and 89.1MB in the end (delta: -43.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.72ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 86.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.34ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 85.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 490.80ms. Allocated memory is still 119.5MB. Free memory was 85.0MB in the beginning and 63.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10282.55ms. Allocated memory was 119.5MB in the beginning and 153.1MB in the end (delta: 33.6MB). Free memory was 62.5MB in the beginning and 62.7MB in the end (delta: -208.6kB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 87707 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 87707 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:29:56,633 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_equal.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:29:58,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:29:58,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:29:58,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:29:58,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:29:58,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:29:58,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:29:58,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:29:58,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:29:58,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:29:58,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:29:58,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:29:58,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:29:58,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:29:58,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:29:58,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:29:58,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:29:58,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:29:58,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:29:58,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:29:58,369 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:29:58,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:29:58,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:29:58,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:29:58,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:29:58,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:29:58,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:29:58,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:29:58,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:29:58,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:29:58,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:29:58,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:29:58,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:29:58,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:29:58,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:29:58,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:29:58,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:29:58,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:29:58,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:29:58,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:29:58,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:29:58,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:29:58,392 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:29:58,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:29:58,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:29:58,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:29:58,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:29:58,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:29:58,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:29:58,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:29:58,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:29:58,420 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:29:58,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:29:58,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:29:58,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:29:58,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:29:58,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:29:58,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:29:58,429 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:29:58,429 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:29:58,429 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:29:58,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:29:58,430 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:29:58,430 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:29:58,430 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:29:58,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:29:58,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:29:58,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:29:58,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:29:58,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:29:58,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:29:58,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:29:58,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:29:58,432 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:29:58,432 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:29:58,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:29:58,432 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2022-07-23 06:29:58,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:29:58,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:29:58,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:29:58,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:29:58,743 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:29:58,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-07-23 06:29:58,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17167753/bc5e753de1ac4c8d95c9d6c0e0139c2d/FLAG1ff0541b9 [2022-07-23 06:29:59,248 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:29:59,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-07-23 06:29:59,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17167753/bc5e753de1ac4c8d95c9d6c0e0139c2d/FLAG1ff0541b9 [2022-07-23 06:29:59,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17167753/bc5e753de1ac4c8d95c9d6c0e0139c2d [2022-07-23 06:29:59,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:29:59,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:29:59,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:29:59,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:29:59,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:29:59,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:29:59" (1/1) ... [2022-07-23 06:29:59,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535bfdb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:29:59, skipping insertion in model container [2022-07-23 06:29:59,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:29:59" (1/1) ... [2022-07-23 06:29:59,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:29:59,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:29:59,949 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_equal.i[24640,24653] [2022-07-23 06:29:59,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:29:59,964 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:30:00,020 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_equal.i[24640,24653] [2022-07-23 06:30:00,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:30:00,042 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:30:00,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:00 WrapperNode [2022-07-23 06:30:00,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:30:00,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:30:00,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:30:00,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:30:00,050 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:00" (1/1) ... [2022-07-23 06:30:00,066 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:00" (1/1) ... [2022-07-23 06:30:00,086 INFO L137 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-07-23 06:30:00,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:30:00,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:30:00,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:30:00,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:30:00,109 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:00" (1/1) ... [2022-07-23 06:30:00,110 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:00" (1/1) ... [2022-07-23 06:30:00,123 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:00" (1/1) ... [2022-07-23 06:30:00,123 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:00" (1/1) ... [2022-07-23 06:30:00,132 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:00" (1/1) ... [2022-07-23 06:30:00,136 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:00" (1/1) ... [2022-07-23 06:30:00,138 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:00" (1/1) ... [2022-07-23 06:30:00,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:30:00,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:30:00,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:30:00,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:30:00,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:00" (1/1) ... [2022-07-23 06:30:00,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:30:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:30:00,169 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:00,182 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:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 06:30:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:30:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:30:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:30:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:30:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:30:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:30:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:30:00,298 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:30:00,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:30:00,724 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:30:00,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:30:00,729 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:30:00,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:30:00 BoogieIcfgContainer [2022-07-23 06:30:00,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:30:00,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:30:00,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:30:00,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:30:00,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:29:59" (1/3) ... [2022-07-23 06:30:00,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1002357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:30:00, skipping insertion in model container [2022-07-23 06:30:00,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:30:00" (2/3) ... [2022-07-23 06:30:00,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1002357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:30:00, skipping insertion in model container [2022-07-23 06:30:00,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:30:00" (3/3) ... [2022-07-23 06:30:00,738 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2022-07-23 06:30:00,752 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:30:00,752 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-07-23 06:30:00,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:30:00,813 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@1f52ac68, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b3ba400 [2022-07-23 06:30:00,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-07-23 06:30:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 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,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:30:00,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:00,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:30:00,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2022-07-23 06:30:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:00,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906035414] [2022-07-23 06:30:00,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:00,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:00,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:00,857 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:00,868 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:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:00,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:30:00,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:00,996 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,007 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:01,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:01,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:01,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906035414] [2022-07-23 06:30:01,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906035414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:01,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:01,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497068096] [2022-07-23 06:30:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:01,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:01,034 INFO L87 Difference]: Start difference. First operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 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:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:01,183 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-07-23 06:30:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:01,185 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:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:01,190 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:30:01,190 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:30:01,191 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:01,193 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:01,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:30:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 06:30:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 63 states have (on average 2.0) internal successors, (126), 119 states have internal predecessors, (126), 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:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-23 06:30:01,226 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2022-07-23 06:30:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:01,226 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-23 06:30:01,227 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:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-23 06:30:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:30:01,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:01,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:30:01,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 06:30:01,436 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:01,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:01,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2022-07-23 06:30:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:01,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676973763] [2022-07-23 06:30:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:01,442 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:01,443 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:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:01,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:30:01,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:01,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:30:01,503 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:01,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:01,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:01,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676973763] [2022-07-23 06:30:01,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676973763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:01,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:01,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655667222] [2022-07-23 06:30:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:01,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:01,507 INFO L87 Difference]: Start difference. First operand 124 states and 132 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:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:01,669 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-07-23 06:30:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:01,670 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:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:01,671 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:30:01,671 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:30:01,671 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:01,672 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:01,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:30:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:30:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 116 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:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-23 06:30:01,678 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2022-07-23 06:30:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:01,679 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-23 06:30:01,679 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:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-23 06:30:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:30:01,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:01,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:30:01,691 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:01,888 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:01,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2022-07-23 06:30:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:01,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310055199] [2022-07-23 06:30:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:01,892 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:01,894 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:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:01,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:30:01,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:01,969 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:01,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:01,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:01,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310055199] [2022-07-23 06:30:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310055199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:01,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:01,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:30:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031229929] [2022-07-23 06:30:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:01,977 INFO L87 Difference]: Start difference. First operand 121 states and 129 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:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:01,998 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-23 06:30:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:01,998 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:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:01,999 INFO L225 Difference]: With dead ends: 132 [2022-07-23 06:30:01,999 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:30:02,000 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:02,000 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 251 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:02,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 251 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:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:30:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2022-07-23 06:30:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-07-23 06:30:02,006 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2022-07-23 06:30:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:02,006 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-07-23 06:30:02,006 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:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-07-23 06:30:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:30:02,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:02,007 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:02,017 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:02,209 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:02,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2022-07-23 06:30:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:02,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017590312] [2022-07-23 06:30:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:02,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:02,212 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:02,214 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:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:02,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:30:02,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:02,301 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:02,333 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:02,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:02,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017590312] [2022-07-23 06:30:02,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017590312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:02,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:02,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:02,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691978427] [2022-07-23 06:30:02,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:02,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:02,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:02,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:02,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:02,335 INFO L87 Difference]: Start difference. First operand 122 states and 130 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:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:02,686 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-07-23 06:30:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:02,686 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:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:02,688 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:30:02,688 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:30:02,689 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:02,689 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 20 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:02,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 357 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:30:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:30:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-23 06:30:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.921875) internal successors, (123), 116 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:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-23 06:30:02,694 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-07-23 06:30:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:02,694 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-23 06:30:02,694 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:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-23 06:30:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:30:02,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:02,695 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:02,715 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:02,902 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:02,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2022-07-23 06:30:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:02,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393754978] [2022-07-23 06:30:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:02,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:02,906 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:02,908 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:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:03,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:30:03,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:03,022 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:03,079 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:03,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:03,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:03,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393754978] [2022-07-23 06:30:03,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393754978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:03,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:03,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303236364] [2022-07-23 06:30:03,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:03,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:03,082 INFO L87 Difference]: Start difference. First operand 121 states and 129 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:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:03,475 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-07-23 06:30:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:03,476 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:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:03,477 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:30:03,477 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:30:03,478 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:03,478 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:03,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 381 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:30:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:30:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-07-23 06:30:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.90625) internal successors, (122), 115 states have internal predecessors, (122), 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:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-23 06:30:03,485 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2022-07-23 06:30:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:03,486 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-23 06:30:03,486 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:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-23 06:30:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:30:03,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:03,487 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:03,497 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:03,697 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:03,697 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:03,698 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2022-07-23 06:30:03,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:03,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906589897] [2022-07-23 06:30:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:03,700 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:03,701 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:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:03,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:30:03,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:03,832 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:03,948 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:30:03,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:30:03,964 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:03,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:04,127 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:04,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906589897] [2022-07-23 06:30:04,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906589897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:04,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:04,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-23 06:30:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853604471] [2022-07-23 06:30:04,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:04,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:30:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:30:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:30:04,130 INFO L87 Difference]: Start difference. First operand 120 states and 128 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:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:04,503 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-07-23 06:30:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:30:04,503 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:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:04,504 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:30:04,504 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:30:04,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:30:04,505 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:04,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 403 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 279 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2022-07-23 06:30:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:30:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-23 06:30:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.8) internal successors, (135), 126 states have internal predecessors, (135), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-23 06:30:04,510 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 26 [2022-07-23 06:30:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:04,510 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-23 06:30:04,510 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:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-23 06:30:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:30:04,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:04,511 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:04,521 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:04,719 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:04,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:04,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2022-07-23 06:30:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50554887] [2022-07-23 06:30:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:04,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:04,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:04,721 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:04,723 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:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:04,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:30:04,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:04,840 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:04,845 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:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:05,006 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:05,013 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:05,013 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:30:05,036 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:05,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:07,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:07,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50554887] [2022-07-23 06:30:07,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50554887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:07,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [485039442] [2022-07-23 06:30:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:07,238 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:07,240 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:07,241 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:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:07,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:30:07,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:07,515 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,520 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,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:07,677 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:07,684 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:07,684 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:30:07,696 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:07,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:09,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [485039442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:09,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:09,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-23 06:30:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559999128] [2022-07-23 06:30:09,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:09,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:30:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:30:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:30:09,875 INFO L87 Difference]: Start difference. First operand 133 states and 143 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:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:10,400 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-07-23 06:30:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:30:10,401 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:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:10,402 INFO L225 Difference]: With dead ends: 135 [2022-07-23 06:30:10,402 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 06:30:10,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:30:10,402 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:10,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 405 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 78 Unchecked, 0.5s Time] [2022-07-23 06:30:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 06:30:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-23 06:30:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 126 states have internal predecessors, (134), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2022-07-23 06:30:10,406 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 26 [2022-07-23 06:30:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:10,407 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2022-07-23 06:30:10,407 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:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2022-07-23 06:30:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:30:10,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:10,413 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:10,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:10,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:10,813 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:10,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2022-07-23 06:30:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:10,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523011543] [2022-07-23 06:30:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:10,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:10,816 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:10,818 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:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:10,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:10,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:10,935 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:10,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:10,967 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:10,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:10,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523011543] [2022-07-23 06:30:10,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523011543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:10,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:10,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-23 06:30:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235198081] [2022-07-23 06:30:10,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:10,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:10,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:10,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:10,969 INFO L87 Difference]: Start difference. First operand 133 states and 142 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:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:11,090 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-07-23 06:30:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:11,091 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:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:11,091 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:11,092 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:11,092 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:11,092 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:11,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 575 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:30:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-23 06:30:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 126 states have internal predecessors, (133), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-07-23 06:30:11,096 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 28 [2022-07-23 06:30:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:11,096 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-07-23 06:30:11,096 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:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-07-23 06:30:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:30:11,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:11,097 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:11,106 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:11,299 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:11,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2022-07-23 06:30:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:11,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418271710] [2022-07-23 06:30:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:11,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:11,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:11,302 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:11,303 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:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:11,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:30:11,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:11,438 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:11,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:11,449 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:30:11,449 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:11,464 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:11,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:11,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418271710] [2022-07-23 06:30:11,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418271710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:11,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-23 06:30:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238387873] [2022-07-23 06:30:11,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:11,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:30:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:30:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:30:11,468 INFO L87 Difference]: Start difference. First operand 133 states and 141 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:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:11,640 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2022-07-23 06:30:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:30:11,641 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:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:11,642 INFO L225 Difference]: With dead ends: 138 [2022-07-23 06:30:11,642 INFO L226 Difference]: Without dead ends: 138 [2022-07-23 06:30:11,642 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:11,642 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:11,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 297 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-23 06:30:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-23 06:30:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-07-23 06:30:11,646 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 29 [2022-07-23 06:30:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:11,646 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-07-23 06:30:11,647 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:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-07-23 06:30:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:30:11,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:11,647 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:11,655 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:11,855 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:11,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2022-07-23 06:30:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:11,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140662124] [2022-07-23 06:30:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:11,857 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:11,859 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:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:11,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:30:11,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:12,043 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:12,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:12,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:30:12,096 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:12,370 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:12,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:12,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140662124] [2022-07-23 06:30:12,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140662124] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:12,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:12,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-23 06:30:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69894491] [2022-07-23 06:30:12,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:12,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:30:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:12,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:30:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:30:12,372 INFO L87 Difference]: Start difference. First operand 136 states and 146 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:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:13,186 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-07-23 06:30:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:30:13,187 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:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:13,188 INFO L225 Difference]: With dead ends: 143 [2022-07-23 06:30:13,188 INFO L226 Difference]: Without dead ends: 143 [2022-07-23 06:30:13,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:30:13,189 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 17 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:13,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1047 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 06:30:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-23 06:30:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-23 06:30:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 129 states have internal predecessors, (137), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-07-23 06:30:13,192 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 29 [2022-07-23 06:30:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:13,192 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-07-23 06:30:13,192 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:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-07-23 06:30:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:30:13,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:13,193 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:13,210 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:13,407 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:13,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2022-07-23 06:30:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:13,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293425525] [2022-07-23 06:30:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:13,410 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:13,411 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:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:13,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:30:13,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:13,534 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,574 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:13,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:13,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:13,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293425525] [2022-07-23 06:30:13,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293425525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:13,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:13,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456518487] [2022-07-23 06:30:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:13,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:13,577 INFO L87 Difference]: Start difference. First operand 136 states and 145 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:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:14,048 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-07-23 06:30:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:14,048 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:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:14,049 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:30:14,049 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:30:14,049 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:14,049 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:14,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 402 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:30:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:30:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-23 06:30:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.7435897435897436) internal successors, (136), 128 states have internal predecessors, (136), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2022-07-23 06:30:14,052 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 30 [2022-07-23 06:30:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:14,052 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2022-07-23 06:30:14,053 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:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2022-07-23 06:30:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:30:14,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:14,053 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:14,061 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:14,253 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:14,254 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2022-07-23 06:30:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:14,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784712838] [2022-07-23 06:30:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:14,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:14,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:14,256 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:14,258 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:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:14,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:30:14,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:14,389 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,474 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:14,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:14,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:14,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784712838] [2022-07-23 06:30:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784712838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:14,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:30:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201752695] [2022-07-23 06:30:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:14,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:30:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:30:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:30:14,476 INFO L87 Difference]: Start difference. First operand 135 states and 144 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:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:14,938 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-07-23 06:30:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:30:14,939 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:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:14,939 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:14,939 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:14,940 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:14,940 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:14,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 432 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:30:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-23 06:30:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 06:30:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2022-07-23 06:30:14,943 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 30 [2022-07-23 06:30:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:14,943 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2022-07-23 06:30:14,943 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:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-07-23 06:30:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:30:14,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:14,944 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:14,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:15,144 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:15,144 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:15,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2022-07-23 06:30:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:15,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991624012] [2022-07-23 06:30:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:15,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:15,148 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:15,150 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:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:15,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:15,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:15,298 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:15,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:15,343 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:15,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:15,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991624012] [2022-07-23 06:30:15,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991624012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:30:15,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:15,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-23 06:30:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015166117] [2022-07-23 06:30:15,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:15,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:15,345 INFO L87 Difference]: Start difference. First operand 134 states and 143 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:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:15,369 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-07-23 06:30:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:30:15,374 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:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:15,374 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:30:15,374 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:30:15,375 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:15,377 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 98 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:15,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 268 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:30:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:30:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 06:30:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 71 states have (on average 1.704225352112676) internal successors, (121), 116 states have internal predecessors, (121), 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:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-07-23 06:30:15,382 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 41 [2022-07-23 06:30:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:15,382 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-07-23 06:30:15,382 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:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-07-23 06:30:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:30:15,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:15,387 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:15,395 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:15,594 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:15,596 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2022-07-23 06:30:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:15,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164063152] [2022-07-23 06:30:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:15,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:15,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:15,599 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:15,601 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:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:15,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:30:15,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:15,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:15,882 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:15,998 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:30:15,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:30:16,022 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:16,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:16,123 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:16,284 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:30:16,285 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:16,310 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:16,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:16,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:16,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164063152] [2022-07-23 06:30:16,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164063152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:16,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1618131642] [2022-07-23 06:30:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:16,535 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:16,537 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:16,550 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:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:16,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:30:16,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:16,866 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:30:16,867 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:16,933 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:30:16,933 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:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:17,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:17,047 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:30:17,047 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:17,123 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:30:17,123 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:17,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:17,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:17,305 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:30:17,305 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:17,629 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:30:17,630 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:17,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:17,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:17,719 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:30:17,719 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:17,815 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:17,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:17,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1618131642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:17,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:17,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2022-07-23 06:30:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308736946] [2022-07-23 06:30:17,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:17,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:30:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:30:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:30:17,889 INFO L87 Difference]: Start difference. First operand 122 states and 127 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:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:26,672 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-07-23 06:30:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:30:26,673 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:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:26,673 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:30:26,674 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:30:26,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:30:26,674 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 15 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:26,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 819 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 409 Invalid, 0 Unknown, 416 Unchecked, 0.6s Time] [2022-07-23 06:30:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:30:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:30:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 78 states have (on average 1.6282051282051282) internal successors, (127), 122 states have internal predecessors, (127), 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:30:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2022-07-23 06:30:26,678 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 43 [2022-07-23 06:30:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:26,678 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2022-07-23 06:30:26,678 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:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-07-23 06:30:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:30:26,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:26,679 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:26,683 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:26,892 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:27,091 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:27,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195672, now seen corresponding path program 1 times [2022-07-23 06:30:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:27,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659817088] [2022-07-23 06:30:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:27,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:27,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:27,095 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:27,096 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:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:27,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:30:27,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:27,371 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:27,379 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:27,396 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:27,426 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:29,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:29,522 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:29,531 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:30:29,532 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:30:29,570 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:31,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:31,684 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:31,932 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:30:31,932 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:32,004 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:32,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:32,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659817088] [2022-07-23 06:30:32,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659817088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1797439516] [2022-07-23 06:30:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:32,235 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:32,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:32,236 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:32,237 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:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:32,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:30:32,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:32,573 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:32,579 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:32,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:32,679 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:32,778 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:35,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:35,006 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:35,269 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:35,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:35,359 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:35,390 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:35,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:36,302 WARN L833 $PredicateComparison]: unable to prove that (and (or (bvule |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (= |c_#StackHeapBarrier| (_ bv0 32))) (forall ((|v_node_create_~temp~0#1.base_72| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_72| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1010 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) (select (store |c_#length| |v_node_create_~temp~0#1.base_72| v_ArrVal_1010) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)))))) is different from false [2022-07-23 06:30:36,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1797439516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:36,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:36,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-23 06:30:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244893629] [2022-07-23 06:30:36,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:36,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:30:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:30:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=4, NotChecked=40, Total=506 [2022-07-23 06:30:36,306 INFO L87 Difference]: Start difference. First operand 129 states and 133 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:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:39,236 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2022-07-23 06:30:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:30:39,237 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:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:39,237 INFO L225 Difference]: With dead ends: 128 [2022-07-23 06:30:39,238 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 06:30:39,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=110, Invalid=645, Unknown=5, NotChecked=52, Total=812 [2022-07-23 06:30:39,238 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:39,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 712 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 321 Unchecked, 0.6s Time] [2022-07-23 06:30:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 06:30:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-23 06:30:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 121 states have internal predecessors, (126), 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:30:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-07-23 06:30:39,241 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 43 [2022-07-23 06:30:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:39,241 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-07-23 06:30:39,241 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:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-07-23 06:30:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:30:39,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:39,241 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:39,252 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:39,459 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:39,650 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:39,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1946956456, now seen corresponding path program 1 times [2022-07-23 06:30:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:39,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638825459] [2022-07-23 06:30:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:39,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:39,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:39,660 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:39,661 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:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:39,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 06:30:39,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:39,853 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:39,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:39,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638825459] [2022-07-23 06:30:39,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638825459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:39,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:39,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:30:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542967397] [2022-07-23 06:30:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:39,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:30:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:30:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:30:39,855 INFO L87 Difference]: Start difference. First operand 128 states and 132 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:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:40,026 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-07-23 06:30:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:30:40,026 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:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:40,027 INFO L225 Difference]: With dead ends: 142 [2022-07-23 06:30:40,027 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 06:30:40,027 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:40,028 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:40,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 102 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 06:30:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-07-23 06:30:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.564102564102564) internal successors, (122), 117 states have internal predecessors, (122), 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:30:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-07-23 06:30:40,030 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 45 [2022-07-23 06:30:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:40,030 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-07-23 06:30:40,030 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:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-07-23 06:30:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:30:40,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:40,031 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:40,041 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:40,244 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:40,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1946956457, now seen corresponding path program 1 times [2022-07-23 06:30:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:40,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852139449] [2022-07-23 06:30:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:40,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:40,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:40,247 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:40,248 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:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:40,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:40,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:40,543 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:40,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:40,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:40,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852139449] [2022-07-23 06:30:40,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852139449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:40,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:40,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:30:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351942510] [2022-07-23 06:30:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:40,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:30:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:30:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:30:40,544 INFO L87 Difference]: Start difference. First operand 124 states and 128 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:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:40,731 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-07-23 06:30:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:40,732 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:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:40,734 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:30:40,735 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:30:40,735 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:40,735 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 244 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:40,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 114 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:30:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 06:30:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 113 states have internal predecessors, (118), 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:30:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-07-23 06:30:40,740 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 45 [2022-07-23 06:30:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:40,741 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-07-23 06:30:40,742 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:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-07-23 06:30:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:40,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:40,744 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:40,757 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:40,958 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:40,958 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 226108014, now seen corresponding path program 1 times [2022-07-23 06:30:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:40,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460228884] [2022-07-23 06:30:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:40,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:40,961 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:40,970 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:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:41,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:30:41,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:41,199 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:41,251 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:41,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:41,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460228884] [2022-07-23 06:30:41,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460228884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:41,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:41,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933244654] [2022-07-23 06:30:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:41,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:41,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:41,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:41,253 INFO L87 Difference]: Start difference. First operand 120 states and 124 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:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:41,720 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-07-23 06:30:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:41,720 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:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:41,721 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:30:41,721 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:30:41,721 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:41,722 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:41,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 235 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:30:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:30:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-07-23 06:30:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 109 states have internal predecessors, (114), 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:30:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-07-23 06:30:41,724 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 46 [2022-07-23 06:30:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:41,724 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-07-23 06:30:41,724 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:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-07-23 06:30:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:41,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:41,725 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:41,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-23 06:30:41,925 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:41,925 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash 226108015, now seen corresponding path program 1 times [2022-07-23 06:30:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:41,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557010767] [2022-07-23 06:30:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:41,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:41,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:41,927 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:41,929 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:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:42,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:30:42,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:42,131 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:42,192 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:42,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:42,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:42,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557010767] [2022-07-23 06:30:42,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557010767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:42,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:42,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798328024] [2022-07-23 06:30:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:42,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:42,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:42,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:42,196 INFO L87 Difference]: Start difference. First operand 116 states and 120 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:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:42,656 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-07-23 06:30:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:42,657 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:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:42,657 INFO L225 Difference]: With dead ends: 112 [2022-07-23 06:30:42,657 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 06:30:42,658 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:42,658 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 73 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:42,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 246 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:30:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 06:30:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-23 06:30:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 105 states have internal predecessors, (110), 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:30:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-07-23 06:30:42,660 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 46 [2022-07-23 06:30:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:42,660 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-07-23 06:30:42,660 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:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-07-23 06:30:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:42,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:42,661 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:42,681 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:42,861 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:42,862 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash 226118937, now seen corresponding path program 1 times [2022-07-23 06:30:42,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:42,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421258179] [2022-07-23 06:30:42,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:42,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:42,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:42,864 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:42,865 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:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:43,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:30:43,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:43,211 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:43,468 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:43,799 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:30:43,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2022-07-23 06:30:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:43,812 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:43,922 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:43,968 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:43,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:44,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:44,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421258179] [2022-07-23 06:30:44,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421258179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:44,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1176426283] [2022-07-23 06:30:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:44,114 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:44,115 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:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:44,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:30:44,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:44,582 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:44,945 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:45,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:45,233 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:45,260 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:30:45,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2022-07-23 06:30:45,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 26 treesize of output 14 [2022-07-23 06:30:45,399 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:45,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:45,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1176426283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:45,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:45,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-07-23 06:30:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500523670] [2022-07-23 06:30:45,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:45,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:30:45,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:45,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:30:45,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=802, Unknown=3, NotChecked=0, Total=930 [2022-07-23 06:30:45,519 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 29 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:30:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:46,883 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-07-23 06:30:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:30:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 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:30:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:46,884 INFO L225 Difference]: With dead ends: 127 [2022-07-23 06:30:46,884 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 06:30:46,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=1396, Unknown=8, NotChecked=0, Total=1640 [2022-07-23 06:30:46,885 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 56 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:46,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 772 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 548 Invalid, 0 Unknown, 114 Unchecked, 0.8s Time] [2022-07-23 06:30:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 06:30:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2022-07-23 06:30:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 104 states have internal predecessors, (109), 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:30:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-07-23 06:30:46,889 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 46 [2022-07-23 06:30:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:46,889 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-07-23 06:30:46,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:30:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-07-23 06:30:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:30:46,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:46,889 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:46,899 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:30:47,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:47,299 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:30:47,299 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 226118938, now seen corresponding path program 1 times [2022-07-23 06:30:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185779087] [2022-07-23 06:30:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:47,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:47,301 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:30:47,302 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:30:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:47,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 06:30:47,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:47,750 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:47,761 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:48,031 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:30:48,040 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:30:48,168 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:30:48,176 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:30:48,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:48,641 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:30:48,678 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:30:48,678 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 15 treesize of output 15 [2022-07-23 06:30:48,687 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:30:48,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:48,713 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:30:48,852 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:30:48,859 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:30:48,924 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:30:48,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:49,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185779087] [2022-07-23 06:30:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185779087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20347266] [2022-07-23 06:30:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:49,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:49,513 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:30:49,515 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:30:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:50,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-23 06:30:50,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:50,116 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:50,124 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:50,735 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:30:50,743 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:30:51,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:51,164 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:30:51,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:51,178 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:30:51,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:51,191 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:30:51,206 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:30:51,206 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 15 treesize of output 15 [2022-07-23 06:30:51,367 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:30:51,373 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:30:51,387 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:51,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [20347266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:52,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:52,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2022-07-23 06:30:52,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463339018] [2022-07-23 06:30:52,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:52,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 06:30:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:52,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 06:30:52,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1102, Unknown=8, NotChecked=0, Total=1260 [2022-07-23 06:30:52,395 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 26 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:30:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:54,218 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-07-23 06:30:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:30:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 26 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 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:30:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:54,219 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:30:54,219 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:30:54,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=275, Invalid=1873, Unknown=14, NotChecked=0, Total=2162 [2022-07-23 06:30:54,220 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 54 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:54,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 542 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 390 Invalid, 0 Unknown, 95 Unchecked, 0.8s Time] [2022-07-23 06:30:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:30:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2022-07-23 06:30:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 103 states have internal predecessors, (108), 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:30:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-07-23 06:30:54,222 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 46 [2022-07-23 06:30:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:54,225 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-07-23 06:30:54,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 26 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:30:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-07-23 06:30:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 06:30:54,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:54,225 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:30:54,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-07-23 06:30:54,436 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:30:54,626 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:30:54,626 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1475150796, now seen corresponding path program 1 times [2022-07-23 06:30:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19294265] [2022-07-23 06:30:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:54,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:54,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:54,628 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:30:54,629 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:30:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:54,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:30:54,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:54,926 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,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:54,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19294265] [2022-07-23 06:30:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19294265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:54,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:54,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:30:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857617513] [2022-07-23 06:30:54,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:54,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:30:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:30:54,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:30:54,932 INFO L87 Difference]: Start difference. First operand 110 states and 114 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:30:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:55,103 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-07-23 06:30:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:30:55,104 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:30:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:55,104 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:30:55,104 INFO L226 Difference]: Without dead ends: 125 [2022-07-23 06:30:55,104 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:30:55,105 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:55,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 114 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-23 06:30:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-23 06:30:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 100 states have internal predecessors, (105), 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:30:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-07-23 06:30:55,108 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 49 [2022-07-23 06:30:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:55,109 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-07-23 06:30:55,109 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:30:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-07-23 06:30:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 06:30:55,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:55,110 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:30:55,120 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:30:55,311 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:30:55,311 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1475150797, now seen corresponding path program 1 times [2022-07-23 06:30:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:55,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794468025] [2022-07-23 06:30:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:55,314 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:30:55,319 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:30:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:55,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:30:55,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:55,612 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:55,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:55,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:55,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794468025] [2022-07-23 06:30:55,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794468025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:55,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:55,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:30:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746731448] [2022-07-23 06:30:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:55,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:30:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:30:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:30:55,613 INFO L87 Difference]: Start difference. First operand 107 states and 111 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:30:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:55,781 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-07-23 06:30:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:30:55,781 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:30:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:55,782 INFO L225 Difference]: With dead ends: 104 [2022-07-23 06:30:55,782 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:30:55,782 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:30:55,782 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 124 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:55,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 116 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:30:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:30:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-23 06:30:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.3076923076923077) 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:30:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-07-23 06:30:55,784 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 49 [2022-07-23 06:30:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:55,785 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-07-23 06:30:55,785 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:30:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-07-23 06:30:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 06:30:55,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:55,785 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:30:55,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-23 06:30:55,991 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:30:55,992 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash 280709232, now seen corresponding path program 1 times [2022-07-23 06:30:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:55,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665523879] [2022-07-23 06:30:55,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:55,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:56,008 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:30:56,019 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:30:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:56,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:30:56,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:56,634 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:30:56,694 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:30:56,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:56,908 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:30:56,964 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:30:56,982 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:56,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:57,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:57,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665523879] [2022-07-23 06:30:57,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665523879] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:57,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [809591228] [2022-07-23 06:30:57,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:57,087 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:30:57,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:30:57,089 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:30:57,090 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:30:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:57,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 06:30:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:57,985 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:30:58,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:30:58,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:30:58,245 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:30:58,248 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,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:30:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [809591228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:30:58,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:30:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-07-23 06:30:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341445853] [2022-07-23 06:30:58,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:30:58,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:30:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:30:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=784, Unknown=18, NotChecked=0, Total=930 [2022-07-23 06:30:58,312 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 29 states, 27 states have (on average 2.814814814814815) internal successors, (76), 25 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:30:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:30:59,000 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-07-23 06:30:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:30:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.814814814814815) internal successors, (76), 25 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 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:30:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:30:59,001 INFO L225 Difference]: With dead ends: 117 [2022-07-23 06:30:59,001 INFO L226 Difference]: Without dead ends: 117 [2022-07-23 06:30:59,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=1361, Unknown=36, NotChecked=0, Total=1640 [2022-07-23 06:30:59,002 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 72 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:30:59,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 398 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-23 06:30:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-23 06:30:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2022-07-23 06:30:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 94 states have internal predecessors, (98), 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:30:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-07-23 06:30:59,004 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 51 [2022-07-23 06:30:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:30:59,004 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-07-23 06:30:59,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.814814814814815) internal successors, (76), 25 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-23 06:30:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-07-23 06:30:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:30:59,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:30:59,005 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:30:59,025 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:30:59,209 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:30:59,409 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:30:59,410 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:30:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:30:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash 869466270, now seen corresponding path program 1 times [2022-07-23 06:30:59,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:30:59,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668691583] [2022-07-23 06:30:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:30:59,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:30:59,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:30:59,412 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:30:59,413 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:30:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:30:59,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:30:59,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:30:59,689 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:30:59,704 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:59,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:30:59,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:30:59,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668691583] [2022-07-23 06:30:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668691583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:30:59,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:30:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:30:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994627691] [2022-07-23 06:30:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:30:59,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:30:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:30:59,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:30:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:30:59,706 INFO L87 Difference]: Start difference. First operand 101 states and 104 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:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:00,114 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-07-23 06:31:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:31:00,115 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:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:00,116 INFO L225 Difference]: With dead ends: 118 [2022-07-23 06:31:00,116 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 06:31:00,116 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:00,116 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 50 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:00,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 243 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:31:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 06:31:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-07-23 06:31:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 93 states have internal predecessors, (97), 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:31:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-07-23 06:31:00,118 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 52 [2022-07-23 06:31:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:00,118 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-07-23 06:31:00,118 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:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-07-23 06:31:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:31:00,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:00,119 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:00,128 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:00,328 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:00,328 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:31:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 869466271, now seen corresponding path program 1 times [2022-07-23 06:31:00,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:00,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447371812] [2022-07-23 06:31:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:00,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:00,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:00,331 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:00,332 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:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:00,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:31:00,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:00,656 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:00,659 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:00,759 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:00,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:31:00,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:00,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447371812] [2022-07-23 06:31:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447371812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:31:00,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:31:00,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:31:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066322167] [2022-07-23 06:31:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:31:00,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:31:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:31:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:31:00,761 INFO L87 Difference]: Start difference. First operand 100 states and 103 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:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:01,483 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-07-23 06:31:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:31:01,484 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:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:01,485 INFO L225 Difference]: With dead ends: 99 [2022-07-23 06:31:01,485 INFO L226 Difference]: Without dead ends: 99 [2022-07-23 06:31:01,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:31:01,486 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:01,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 253 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 06:31:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-23 06:31:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-23 06:31:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.28) internal successors, (96), 92 states have internal predecessors, (96), 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:31:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-07-23 06:31:01,489 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 52 [2022-07-23 06:31:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:01,490 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-07-23 06:31:01,490 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:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-07-23 06:31:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 06:31:01,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:01,490 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:01,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:01,699 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:01,700 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:31:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650644, now seen corresponding path program 1 times [2022-07-23 06:31:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:01,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225810509] [2022-07-23 06:31:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:01,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:01,702 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:01,704 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:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:02,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 06:31:02,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:02,215 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,439 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:02,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:02,596 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:02,606 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,614 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:31:02,614 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:02,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:02,976 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:02,976 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:03,066 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-23 06:31:03,067 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 34 treesize of output 63 [2022-07-23 06:31:03,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:03,093 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:03,397 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:03,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:03,547 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:03,801 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:03,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:04,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:04,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225810509] [2022-07-23 06:31:04,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225810509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:04,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1909381524] [2022-07-23 06:31:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:04,137 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:04,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:04,138 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:04,139 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:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:04,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-23 06:31:04,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:05,248 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:06,168 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:06,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:06,756 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:06,761 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:07,239 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-23 06:31:07,239 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 34 treesize of output 63 [2022-07-23 06:31:07,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:07,262 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:07,262 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:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:07,284 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:07,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:07,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:07,642 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:31:07,643 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:07,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:31:08,144 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:08,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:08,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1909381524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:08,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:08,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2022-07-23 06:31:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642667631] [2022-07-23 06:31:08,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-23 06:31:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:08,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-23 06:31:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2146, Unknown=17, NotChecked=0, Total=2352 [2022-07-23 06:31:08,417 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 44 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:31:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:10,899 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-07-23 06:31:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:31:10,900 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 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:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:10,901 INFO L225 Difference]: With dead ends: 98 [2022-07-23 06:31:10,901 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 06:31:10,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=326, Invalid=3811, Unknown=23, NotChecked=0, Total=4160 [2022-07-23 06:31:10,903 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:10,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 672 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 440 Invalid, 0 Unknown, 242 Unchecked, 0.9s Time] [2022-07-23 06:31:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 06:31:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 06:31:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 91 states have internal predecessors, (95), 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:31:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-07-23 06:31:10,912 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 53 [2022-07-23 06:31:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:10,912 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-07-23 06:31:10,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:31:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-07-23 06:31:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 06:31:10,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:10,924 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:31:10,947 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:11,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:11,341 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:11,341 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:31:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650645, now seen corresponding path program 1 times [2022-07-23 06:31:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263321223] [2022-07-23 06:31:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:11,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:11,344 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:11,344 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:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:11,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-23 06:31:11,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:11,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:11,793 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:11,818 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:11,945 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:31:11,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:31:12,421 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:12,421 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:31:12,509 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-23 06:31:12,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-23 06:31:12,938 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:12,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:31:13,264 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-23 06:31:13,265 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 85 treesize of output 49 [2022-07-23 06:31:13,320 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:13,320 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:13,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-23 06:31:13,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-07-23 06:31:14,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:14,090 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:14,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 73 [2022-07-23 06:31:14,141 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-23 06:31:14,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-23 06:31:14,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:14,163 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:14,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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:14,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:14,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:14,594 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-23 06:31:14,595 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 115 treesize of output 64 [2022-07-23 06:31:14,627 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-23 06:31:14,628 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 28 treesize of output 18 [2022-07-23 06:31:14,937 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:14,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:18,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263321223] [2022-07-23 06:31:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263321223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1496661674] [2022-07-23 06:31:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:18,508 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:18,508 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:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:19,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-23 06:31:19,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:19,466 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,475 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:20,890 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:31:20,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:31:20,910 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:22,018 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:22,048 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:22,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:22,797 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:22,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:22,807 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:23,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:23,719 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:23,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:23,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:23,734 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:23,734 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:23,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:23,755 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:23,756 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:23,782 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-23 06:31:23,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-23 06:31:24,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:31:24,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:24,315 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:31:24,315 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 95 treesize of output 50 [2022-07-23 06:31:24,734 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-23 06:31:24,735 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:25,150 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:25,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:29,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1496661674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:29,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:31:29,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 52 [2022-07-23 06:31:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443290238] [2022-07-23 06:31:29,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:31:29,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-23 06:31:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:31:29,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-23 06:31:29,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3179, Unknown=19, NotChecked=0, Total=3422 [2022-07-23 06:31:29,223 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 53 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:31:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:31:37,461 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-07-23 06:31:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:31:37,462 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 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:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:31:37,463 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:31:37,463 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:31:37,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=436, Invalid=5853, Unknown=31, NotChecked=0, Total=6320 [2022-07-23 06:31:37,464 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 43 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:31:37,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 881 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 531 Invalid, 0 Unknown, 362 Unchecked, 1.8s Time] [2022-07-23 06:31:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:31:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-23 06:31:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 90 states have internal predecessors, (94), 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:31:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-07-23 06:31:37,466 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 53 [2022-07-23 06:31:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:31:37,466 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-07-23 06:31:37,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-23 06:31:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-07-23 06:31:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:31:37,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:31:37,467 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:37,479 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:37,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-23 06:31:37,869 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:37,869 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:31:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:31:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -939292314, now seen corresponding path program 1 times [2022-07-23 06:31:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:31:37,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644340418] [2022-07-23 06:31:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:31:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:31:37,872 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:37,873 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:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:38,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-23 06:31:38,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:38,450 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:38,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:38,511 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:38,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:38,773 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-23 06:31:38,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2022-07-23 06:31:38,924 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:39,775 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:40,301 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:31:40,302 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:40,310 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:40,317 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:41,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:41,521 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:41,521 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:41,613 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:31:41,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2022-07-23 06:31:41,728 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:41,729 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:41,737 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,543 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:44,101 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-23 06:31:44,102 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,478 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-23 06:31:44,479 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,489 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,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:44,830 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,841 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:45,207 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:45,678 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:31:45,678 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,177 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,619 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,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:31:49,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (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_3061) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3062) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3063) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3064) |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:52,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3061) .cse1 v_ArrVal_3062) (select (select |c_#memory_$Pointer$.base| .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3063))) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3064) |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:53,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:31:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644340418] [2022-07-23 06:31:53,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644340418] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:31:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1237521519] [2022-07-23 06:31:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:31:53,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:31:53,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:31:53,190 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:53,192 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:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:31:54,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-23 06:31:54,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:31:55,735 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:57,625 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:58,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:31:58,851 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:58,859 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:58,866 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:59,446 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:31:59,447 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:59,474 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:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:31:59,533 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:31:59,534 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:59,607 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-23 06:31:59,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2022-07-23 06:32:04,331 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:06,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:32:06,203 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:06,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:06,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:06,920 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 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-23 06:32:07,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:07,617 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 28 treesize of output 26 [2022-07-23 06:32:07,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:32:08,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:08,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:32:08,816 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:08,817 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:10,483 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:10,533 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:10,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:11,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3064 (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_3205) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3206) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3207) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3064) |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:14,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1237521519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:32:14,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:32:14,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 58 [2022-07-23 06:32:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246197436] [2022-07-23 06:32:14,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:32:14,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-23 06:32:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:32:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-23 06:32:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=5050, Unknown=98, NotChecked=444, Total=6006 [2022-07-23 06:32:14,610 INFO L87 Difference]: Start difference. First operand 97 states and 100 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:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:32:21,080 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-07-23 06:32:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 06:32:21,081 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:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:32:21,081 INFO L225 Difference]: With dead ends: 98 [2022-07-23 06:32:21,081 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 06:32:21,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2653 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=598, Invalid=7683, Unknown=103, NotChecked=546, Total=8930 [2022-07-23 06:32:21,083 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:32:21,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 549 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 420 Invalid, 0 Unknown, 335 Unchecked, 1.8s Time] [2022-07-23 06:32:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 06:32:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 06:32:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 91 states have internal predecessors, (96), 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:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-07-23 06:32:21,085 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 58 [2022-07-23 06:32:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:32:21,085 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-07-23 06:32:21,099 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:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-07-23 06:32:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:32:21,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:32:21,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:32:21,122 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:21,315 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:21,507 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:21,508 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-07-23 06:32:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:32:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -939292313, now seen corresponding path program 1 times [2022-07-23 06:32:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:32:21,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783710994] [2022-07-23 06:32:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:32:21,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:32:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:32:21,510 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:21,511 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:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:32:22,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-23 06:32:22,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:32:22,168 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:22,203 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:22,411 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:32:22,412 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:32:22,580 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:23,449 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:23,914 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:32:23,915 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:23,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 7 treesize of output 3 [2022-07-23 06:32:23,931 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:24,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:25,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:25,058 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-23 06:32:25,059 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:25,095 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 06:32:25,095 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 15 treesize of output 15 [2022-07-23 06:32:25,248 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:32:25,248 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:25,258 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:27,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:32:27,656 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-07-23 06:32:27,656 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:27,666 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:27,987 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-23 06:32:27,987 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:27,996 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:28,108 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:32:28,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:32:28,122 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:28,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:28,320 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:28,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32:28,341 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:28,352 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:28,626 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:28,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:32:28,932 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:32:28,933 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:28,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:32: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, 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:29,309 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:29,319 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:29,795 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:29,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:32:30,623 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (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_3358) |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)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |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|) (_ 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_3357) |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:30,673 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (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_3355) |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|))) (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_3356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (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_3355) |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|) (_ 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_3357) |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:30,812 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_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)))) (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_3355) |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|) (_ 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_3353) |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_3357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (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_3355) |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|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-23 06:32:32,542 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_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))) (v_ArrVal_3351 (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_3352) |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_3355) |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|) (_ 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_3351) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3353) |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_3357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (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_3352) |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_3355) |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|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-23 06:32:34,839 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (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_3352) |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_3355) |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|))) (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_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))) (v_ArrVal_3351 (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_3352) |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_3355) |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|) (_ 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_3351) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3353) |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_3357) |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:37,671 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_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))) (v_ArrVal_3351 (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_3352) |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_3355) |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|) (_ 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_3351) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3353) |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_3357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (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_3352) |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_3355) |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|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-23 06:32:39,098 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_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))) (v_ArrVal_3351 (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_3352) .cse0 v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3355) |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|) (_ 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_3351) .cse0 v_ArrVal_3353) |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_3357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (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_3352) (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_3355) |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|))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2022-07-23 06:32:39,365 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (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_3352) (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_3355) |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|))) (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_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))) (v_ArrVal_3351 (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_3352) .cse1 v_ArrVal_3354) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3355) |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|) (_ 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_3351) .cse1 v_ArrVal_3353) |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_3357) |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:53,979 WARN L233 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:32:57,171 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_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))) (v_ArrVal_3351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (bvadd (_ bv4 32) (select .cse0 |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 .cse0 |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_3352) .cse1 v_ArrVal_3354) .cse2 v_ArrVal_3355) |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|) (_ 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 .cse3 |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_3351) .cse1 v_ArrVal_3353) .cse2 v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (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 .cse5 |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_3352) .cse6 v_ArrVal_3354) (select (select |c_#memory_$Pointer$.base| .cse6) (bvadd (_ bv4 32) (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3355)) |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|))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))) is different from false [2022-07-23 06:33:00,702 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_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))) (v_ArrVal_3351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (bvadd (_ bv4 32) (select .cse0 |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 .cse0 |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_3352) .cse1 v_ArrVal_3354) .cse2 v_ArrVal_3355) |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|) (_ 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 .cse3 |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_3351) .cse1 v_ArrVal_3353) .cse2 v_ArrVal_3356) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_3357) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (forall ((v_ArrVal_3358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (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 .cse5 |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_3352) .cse6 v_ArrVal_3354) (select (select |c_#memory_$Pointer$.base| .cse6) (bvadd (_ bv4 32) (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_3355)) |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|))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2022-07-23 06:33:05,134 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:33:22,475 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:33:22,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:33:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783710994] [2022-07-23 06:33:22,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783710994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:33:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [839649994] [2022-07-23 06:33:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:33:22,477 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:33:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:33:22,479 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:33:22,483 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:33:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:33:23,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-23 06:33:23,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:33:23,640 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:26,773 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:41,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:33:41,839 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:33:50,549 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:54,582 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:34:05,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:34:05,543 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