./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 6c24879c 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-?-6c24879 [2022-07-12 19:11:25,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:11:25,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:11:25,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:11:25,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:11:25,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:11:25,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:11:25,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:11:25,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:11:25,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:11:25,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:11:25,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:11:25,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:11:25,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:11:25,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:11:25,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:11:25,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:11:25,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:11:25,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:11:25,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:11:25,146 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:11:25,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:11:25,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:11:25,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:11:25,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:11:25,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:11:25,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:11:25,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:11:25,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:11:25,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:11:25,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:11:25,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:11:25,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:11:25,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:11:25,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:11:25,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:11:25,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:11:25,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:11:25,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:11:25,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:11:25,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:11:25,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:11:25,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:11:25,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:11:25,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:11:25,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:11:25,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:11:25,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:11:25,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:11:25,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:11:25,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:11:25,202 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:11:25,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:11:25,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:11:25,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:11:25,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:11:25,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:11:25,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:11:25,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:11:25,204 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:11:25,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:11:25,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:11:25,205 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:11:25,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:11:25,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:11:25,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:11:25,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:11:25,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:11:25,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:11:25,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:11:25,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:11:25,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:11:25,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:11:25,207 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-12 19:11:25,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:11:25,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:11:25,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:11:25,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:11:25,485 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:11:25,486 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-12 19:11:25,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10689c227/287bd3feb0b943618504b2588471c069/FLAG66e04068f [2022-07-12 19:11:26,020 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:11:26,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-07-12 19:11:26,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10689c227/287bd3feb0b943618504b2588471c069/FLAG66e04068f [2022-07-12 19:11:26,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10689c227/287bd3feb0b943618504b2588471c069 [2022-07-12 19:11:26,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:11:26,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:11:26,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:11:26,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:11:26,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:11:26,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc3f0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26, skipping insertion in model container [2022-07-12 19:11:26,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:11:26,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:11:26,700 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-12 19:11:26,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:11:26,710 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:11:26,757 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-12 19:11:26,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:11:26,789 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:11:26,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26 WrapperNode [2022-07-12 19:11:26,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:11:26,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:11:26,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:11:26,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:11:26,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,844 INFO L137 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2022-07-12 19:11:26,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:11:26,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:11:26,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:11:26,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:11:26,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:11:26,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:11:26,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:11:26,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:11:26,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (1/1) ... [2022-07-12 19:11:26,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:11:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:26,930 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-12 19:11:26,932 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-12 19:11:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:11:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:11:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:11:26,962 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:11:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:11:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:11:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:11:26,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:11:27,050 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:11:27,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:11:27,422 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:11:27,429 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:11:27,430 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 19:11:27,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:11:27 BoogieIcfgContainer [2022-07-12 19:11:27,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:11:27,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:11:27,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:11:27,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:11:27,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:11:26" (1/3) ... [2022-07-12 19:11:27,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107814d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:11:27, skipping insertion in model container [2022-07-12 19:11:27,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:26" (2/3) ... [2022-07-12 19:11:27,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107814d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:11:27, skipping insertion in model container [2022-07-12 19:11:27,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:11:27" (3/3) ... [2022-07-12 19:11:27,441 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2022-07-12 19:11:27,455 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:11:27,455 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-07-12 19:11:27,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:11:27,522 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@42ccf21c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76c6a0b9 [2022-07-12 19:11:27,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-07-12 19:11:27,527 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-12 19:11:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:11:27,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:27,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:11:27,547 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-12 19:11:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2022-07-12 19:11:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:27,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214721612] [2022-07-12 19:11:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:27,741 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-12 19:11:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214721612] [2022-07-12 19:11:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214721612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:27,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:11:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010467853] [2022-07-12 19:11:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:27,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:11:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:11:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:11:27,785 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-12 19:11:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:27,929 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-07-12 19:11:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:11:27,931 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-12 19:11:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:27,939 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:11:27,939 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:11:27,941 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-12 19:11:27,943 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-12 19:11:27,944 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-12 19:11:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:11:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-12 19:11:27,975 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-12 19:11:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-12 19:11:27,978 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2022-07-12 19:11:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:27,978 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-12 19:11:27,979 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-12 19:11:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-12 19:11:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:11:27,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:27,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:11:27,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:11:27,980 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-12 19:11:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2022-07-12 19:11:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:27,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522764029] [2022-07-12 19:11:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,041 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-12 19:11:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:28,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522764029] [2022-07-12 19:11:28,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522764029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:28,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:28,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:11:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015362411] [2022-07-12 19:11:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:28,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:11:28,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:11:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:11:28,053 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-12 19:11:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:28,148 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-07-12 19:11:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:11:28,148 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-12 19:11:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:28,150 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:11:28,150 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:11:28,150 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-12 19:11:28,152 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:28,152 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-12 19:11:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:11:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:11:28,159 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-12 19:11:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-12 19:11:28,162 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2022-07-12 19:11:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:28,162 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-12 19:11:28,162 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-12 19:11:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-12 19:11:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:11:28,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:28,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:11:28,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:11:28,164 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-12 19:11:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2022-07-12 19:11:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:28,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606447198] [2022-07-12 19:11:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,272 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-12 19:11:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:28,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606447198] [2022-07-12 19:11:28,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606447198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:28,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:28,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:11:28,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728827783] [2022-07-12 19:11:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:28,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:11:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:11:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:11:28,278 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-12 19:11:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:28,402 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-12 19:11:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:11:28,404 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-12 19:11:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:28,407 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:11:28,407 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:11:28,408 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-12 19:11:28,416 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-12 19:11:28,417 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-12 19:11:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:11:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2022-07-12 19:11:28,433 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-12 19:11:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-07-12 19:11:28,435 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2022-07-12 19:11:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:28,435 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-07-12 19:11:28,436 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-12 19:11:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-07-12 19:11:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:11:28,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:28,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:11:28,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:11:28,438 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-12 19:11:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2022-07-12 19:11:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:28,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879334088] [2022-07-12 19:11:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,607 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-12 19:11:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:28,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879334088] [2022-07-12 19:11:28,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879334088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:28,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:28,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:11:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517988293] [2022-07-12 19:11:28,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:28,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:11:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:11:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:11:28,610 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-12 19:11:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:28,860 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-07-12 19:11:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:28,860 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-12 19:11:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:28,863 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:11:28,864 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:11:28,864 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-12 19:11:28,873 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 19:11:28,874 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-12 19:11:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:11:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-12 19:11:28,886 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-12 19:11:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-12 19:11:28,890 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-07-12 19:11:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:28,891 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-12 19:11:28,891 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-12 19:11:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-12 19:11:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:11:28,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:28,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:11:28,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:11:28,892 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-12 19:11:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2022-07-12 19:11:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:28,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110947014] [2022-07-12 19:11:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:29,047 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-12 19:11:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:29,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110947014] [2022-07-12 19:11:29,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110947014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:29,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:29,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:11:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906939552] [2022-07-12 19:11:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:29,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:11:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:11:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:11:29,050 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-12 19:11:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:29,271 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-07-12 19:11:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:29,272 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-12 19:11:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:29,273 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:11:29,273 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:11:29,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:11:29,274 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 19 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 19:11:29,274 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-12 19:11:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:11:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-07-12 19:11:29,278 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-12 19:11:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-12 19:11:29,279 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2022-07-12 19:11:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:29,280 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-12 19:11:29,280 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-12 19:11:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-12 19:11:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:11:29,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:29,280 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-12 19:11:29,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:11:29,281 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-12 19:11:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2022-07-12 19:11:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:29,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582575335] [2022-07-12 19:11:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:29,426 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-12 19:11:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:29,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582575335] [2022-07-12 19:11:29,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582575335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:29,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739581756] [2022-07-12 19:11:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:29,429 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-12 19:11:29,434 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-12 19:11:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:29,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:11:29,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:29,633 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-12 19:11:29,834 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:11:29,834 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-12 19:11:29,853 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-12 19:11:29,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:29,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739581756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:29,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:29,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-12 19:11:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744139743] [2022-07-12 19:11:29,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:29,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:11:29,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:11:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:11:29,926 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-12 19:11:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:30,192 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-07-12 19:11:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:30,193 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-12 19:11:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:30,194 INFO L225 Difference]: With dead ends: 145 [2022-07-12 19:11:30,194 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 19:11:30,194 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-12 19:11:30,196 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-12 19:11:30,196 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-12 19:11:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 19:11:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2022-07-12 19:11:30,214 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-12 19:11:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-07-12 19:11:30,216 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 26 [2022-07-12 19:11:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:30,217 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-07-12 19:11:30,217 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-12 19:11:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-07-12 19:11:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:11:30,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:30,219 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-12 19:11:30,248 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-12 19:11:30,435 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-12 19:11:30,436 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-12 19:11:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2022-07-12 19:11:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:30,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864730393] [2022-07-12 19:11:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:30,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:30,665 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-12 19:11:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:30,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864730393] [2022-07-12 19:11:30,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864730393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:30,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339983202] [2022-07-12 19:11:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:30,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:30,668 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-12 19:11:30,679 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-12 19:11:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:30,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:11:30,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:30,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:11:30,825 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-12 19:11:31,036 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-12 19:11:31,037 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-12 19:11:31,056 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:11:31,056 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-12 19:11:31,103 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-12 19:11:31,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:31,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339983202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:31,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:31,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 19:11:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588316256] [2022-07-12 19:11:31,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:31,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:11:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:11:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:11:31,277 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-12 19:11:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:31,806 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-12 19:11:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:11:31,807 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-12 19:11:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:31,808 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:11:31,808 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:11:31,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-07-12 19:11:31,809 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 16 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-12 19:11:31,809 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-12 19:11:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:11:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-12 19:11:31,812 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-12 19:11:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-12 19:11:31,813 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 26 [2022-07-12 19:11:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:31,817 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-12 19:11:31,817 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-12 19:11:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-12 19:11:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:11:31,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:31,818 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-12 19:11:31,846 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-12 19:11:32,031 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-12 19:11:32,032 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-12 19:11:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2022-07-12 19:11:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:32,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150774419] [2022-07-12 19:11:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,128 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-12 19:11:32,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:32,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150774419] [2022-07-12 19:11:32,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150774419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:32,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44891618] [2022-07-12 19:11:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:32,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:32,131 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-12 19:11:32,157 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-12 19:11:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:11:32,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:32,294 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-12 19:11:32,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:32,354 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-12 19:11:32,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44891618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:32,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:11:32,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-12 19:11:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727851945] [2022-07-12 19:11:32,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:32,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:11:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:32,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:11:32,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:11:32,357 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-12 19:11:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:32,477 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-12 19:11:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:32,477 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-12 19:11:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:32,478 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:11:32,478 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:11:32,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:11:32,479 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-12 19:11:32,480 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-12 19:11:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:11:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-07-12 19:11:32,483 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-12 19:11:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2022-07-12 19:11:32,484 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 28 [2022-07-12 19:11:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:32,484 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2022-07-12 19:11:32,484 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-12 19:11:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2022-07-12 19:11:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:11:32,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:32,485 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-12 19:11:32,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:11:32,708 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-12 19:11:32,708 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-12 19:11:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2022-07-12 19:11:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573004801] [2022-07-12 19:11:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:32,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,791 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-12 19:11:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:32,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573004801] [2022-07-12 19:11:32,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573004801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:32,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262692746] [2022-07-12 19:11:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:32,794 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-12 19:11:32,821 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-12 19:11:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:32,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:11:32,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:32,941 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-12 19:11:32,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:32,952 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:11:32,953 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-12 19:11:32,971 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-12 19:11:32,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262692746] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:32,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:11:32,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-12 19:11:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775360945] [2022-07-12 19:11:32,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:11:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:11:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:11:32,974 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-12 19:11:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:33,133 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-12 19:11:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:33,134 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-12 19:11:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:33,135 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:11:33,135 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:11:33,135 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-12 19:11:33,136 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-12 19:11:33,136 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-12 19:11:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:11:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2022-07-12 19:11:33,139 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-12 19:11:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-07-12 19:11:33,140 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 29 [2022-07-12 19:11:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:33,140 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-07-12 19:11:33,140 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-12 19:11:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-07-12 19:11:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:11:33,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:33,141 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-12 19:11:33,166 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-12 19:11:33,351 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-12 19:11:33,352 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-12 19:11:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2022-07-12 19:11:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858842713] [2022-07-12 19:11:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:33,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:33,509 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-12 19:11:33,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:33,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858842713] [2022-07-12 19:11:33,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858842713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:33,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748107971] [2022-07-12 19:11:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:33,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:33,512 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-12 19:11:33,528 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-12 19:11:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:33,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 19:11:33,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:33,743 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-12 19:11:33,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:33,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:11:33,771 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-12 19:11:33,864 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-12 19:11:33,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748107971] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:33,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:11:33,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-12 19:11:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944540303] [2022-07-12 19:11:33,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:11:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:11:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:11:33,867 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-12 19:11:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:34,134 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-07-12 19:11:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:11:34,135 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-12 19:11:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:34,136 INFO L225 Difference]: With dead ends: 135 [2022-07-12 19:11:34,136 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 19:11:34,136 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-12 19:11:34,137 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 33 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 19:11:34,137 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-12 19:11:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 19:11:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-07-12 19:11:34,140 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-12 19:11:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-07-12 19:11:34,141 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 29 [2022-07-12 19:11:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:34,141 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-07-12 19:11:34,141 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-12 19:11:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-07-12 19:11:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:11:34,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:34,142 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-12 19:11:34,169 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-12 19:11:34,342 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-12 19:11:34,343 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-12 19:11:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2022-07-12 19:11:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:34,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050851404] [2022-07-12 19:11:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:34,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:34,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:34,458 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-12 19:11:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:34,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050851404] [2022-07-12 19:11:34,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050851404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:34,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:34,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:11:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000360868] [2022-07-12 19:11:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:34,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:11:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:11:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:11:34,463 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-12 19:11:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:34,709 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-07-12 19:11:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:11:34,710 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-12 19:11:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:34,710 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:11:34,710 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:11:34,711 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-12 19:11:34,711 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-12 19:11:34,711 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-12 19:11:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:11:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-12 19:11:34,714 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-12 19:11:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-07-12 19:11:34,715 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2022-07-12 19:11:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:34,715 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-07-12 19:11:34,715 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-12 19:11:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-07-12 19:11:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:11:34,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:34,716 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-12 19:11:34,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:11:34,716 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-12 19:11:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2022-07-12 19:11:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:34,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073817245] [2022-07-12 19:11:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:34,854 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-12 19:11:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073817245] [2022-07-12 19:11:34,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073817245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:34,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:34,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:11:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350696920] [2022-07-12 19:11:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:34,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:11:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:11:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:11:34,858 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-12 19:11:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:35,102 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-07-12 19:11:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:11:35,102 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-12 19:11:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:35,103 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:11:35,103 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:11:35,104 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-12 19:11:35,104 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-12 19:11:35,104 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-12 19:11:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:11:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-12 19:11:35,107 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-12 19:11:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-07-12 19:11:35,108 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 30 [2022-07-12 19:11:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:35,108 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-07-12 19:11:35,108 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-12 19:11:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-07-12 19:11:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:11:35,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:35,109 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-12 19:11:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:11:35,109 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-12 19:11:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2022-07-12 19:11:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724286149] [2022-07-12 19:11:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 19:11:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,201 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-12 19:11:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724286149] [2022-07-12 19:11:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724286149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623491715] [2022-07-12 19:11:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:35,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:35,204 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-12 19:11:35,212 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-12 19:11:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:11:35,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:35,396 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-12 19:11:35,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623491715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:35,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:11:35,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-12 19:11:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752497476] [2022-07-12 19:11:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:35,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:11:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:11:35,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:11:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:11:35,399 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-12 19:11:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:35,410 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-12 19:11:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:11:35,411 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-12 19:11:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:35,412 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:11:35,412 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:11:35,412 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-12 19:11:35,413 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-12 19:11:35,413 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-12 19:11:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:11:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 19:11:35,419 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-12 19:11:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-07-12 19:11:35,419 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 41 [2022-07-12 19:11:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:35,420 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-07-12 19:11:35,420 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-12 19:11:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-07-12 19:11:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:11:35,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:35,424 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-12 19:11:35,452 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-12 19:11:35,644 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-12 19:11:35,645 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-12 19:11:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2022-07-12 19:11:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:11:35,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372435056] [2022-07-12 19:11:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:11:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:11:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:11:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:11:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:35,836 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-12 19:11:35,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:11:35,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372435056] [2022-07-12 19:11:35,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372435056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:35,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964865024] [2022-07-12 19:11:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:35,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:11:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:35,838 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-12 19:11:35,840 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-12 19:11:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:36,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:11:36,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:36,018 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-12 19:11:36,027 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-12 19:11:36,146 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 19:11:36,172 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-12 19:11:36,347 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-12 19:11:36,347 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 87861 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-12 19:11:36,350 INFO L158 Benchmark]: Toolchain (without parser) took 9972.43ms. Allocated memory was 98.6MB in the beginning and 159.4MB in the end (delta: 60.8MB). Free memory was 63.6MB in the beginning and 61.3MB in the end (delta: 2.3MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2022-07-12 19:11:36,351 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 98.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:11:36,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.29ms. Allocated memory is still 98.6MB. Free memory was 63.3MB in the beginning and 64.5MB in the end (delta: -1.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 19:11:36,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.30ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:11:36,351 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 98.6MB. Free memory was 62.1MB in the beginning and 60.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:11:36,351 INFO L158 Benchmark]: RCFGBuilder took 540.17ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 60.3MB in the beginning and 98.5MB in the end (delta: -38.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-07-12 19:11:36,352 INFO L158 Benchmark]: TraceAbstraction took 8916.11ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 97.9MB in the beginning and 61.3MB in the end (delta: 36.6MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-07-12 19:11:36,353 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.63ms. Allocated memory is still 98.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.29ms. Allocated memory is still 98.6MB. Free memory was 63.3MB in the beginning and 64.5MB in the end (delta: -1.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.30ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 98.6MB. Free memory was 62.1MB in the beginning and 60.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 540.17ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 60.3MB in the beginning and 98.5MB in the end (delta: -38.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8916.11ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 97.9MB in the beginning and 61.3MB in the end (delta: 36.6MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 87861 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 87861 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-12 19:11:36,365 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-?-6c24879 [2022-07-12 19:11:38,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:11:38,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:11:38,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:11:38,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:11:38,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:11:38,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:11:38,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:11:38,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:11:38,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:11:38,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:11:38,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:11:38,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:11:38,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:11:38,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:11:38,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:11:38,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:11:38,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:11:38,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:11:38,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:11:38,389 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:11:38,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:11:38,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:11:38,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:11:38,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:11:38,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:11:38,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:11:38,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:11:38,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:11:38,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:11:38,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:11:38,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:11:38,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:11:38,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:11:38,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:11:38,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:11:38,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:11:38,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:11:38,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:11:38,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:11:38,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:11:38,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:11:38,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:11:38,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:11:38,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:11:38,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:11:38,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:11:38,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:11:38,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:11:38,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:11:38,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:11:38,452 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:11:38,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:11:38,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:11:38,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:11:38,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:11:38,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:11:38,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:11:38,465 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:11:38,465 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:11:38,465 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:11:38,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:11:38,466 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:11:38,466 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:11:38,466 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:11:38,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:11:38,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:11:38,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:11:38,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:11:38,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:11:38,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:11:38,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:11:38,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:11:38,468 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:11:38,468 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:11:38,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:11:38,469 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-12 19:11:38,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:11:38,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:11:38,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:11:38,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:11:38,793 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:11:38,794 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-12 19:11:38,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e583ce1/4a949b0791cc42ba90967f45c4867511/FLAG56e4d9bc7 [2022-07-12 19:11:39,327 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:11:39,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-07-12 19:11:39,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e583ce1/4a949b0791cc42ba90967f45c4867511/FLAG56e4d9bc7 [2022-07-12 19:11:39,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e583ce1/4a949b0791cc42ba90967f45c4867511 [2022-07-12 19:11:39,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:11:39,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:11:39,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:11:39,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:11:39,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:11:39,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:11:39" (1/1) ... [2022-07-12 19:11:39,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2b7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:39, skipping insertion in model container [2022-07-12 19:11:39,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:11:39" (1/1) ... [2022-07-12 19:11:39,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:11:39,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:11:40,042 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-12 19:11:40,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:11:40,065 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:11:40,119 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-12 19:11:40,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:11:40,163 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:11:40,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40 WrapperNode [2022-07-12 19:11:40,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:11:40,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:11:40,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:11:40,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:11:40,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,229 INFO L137 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-07-12 19:11:40,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:11:40,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:11:40,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:11:40,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:11:40,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:11:40,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:11:40,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:11:40,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:11:40,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (1/1) ... [2022-07-12 19:11:40,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:11:40,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:11:40,313 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-12 19:11:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:11:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:11:40,350 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:11:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:11:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:11:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:11:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:11:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:11:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:11:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:11:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:11:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:11:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:11:40,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:11:40,339 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-12 19:11:40,510 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:11:40,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:11:41,104 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:11:41,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:11:41,112 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 19:11:41,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:11:41 BoogieIcfgContainer [2022-07-12 19:11:41,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:11:41,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:11:41,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:11:41,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:11:41,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:11:39" (1/3) ... [2022-07-12 19:11:41,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65024b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:11:41, skipping insertion in model container [2022-07-12 19:11:41,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:11:40" (2/3) ... [2022-07-12 19:11:41,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65024b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:11:41, skipping insertion in model container [2022-07-12 19:11:41,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:11:41" (3/3) ... [2022-07-12 19:11:41,121 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2022-07-12 19:11:41,132 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:11:41,133 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-07-12 19:11:41,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:11:41,184 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@7cb1cabf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15f4c6d2 [2022-07-12 19:11:41,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-07-12 19:11:41,191 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-12 19:11:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:11:41,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:41,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:11:41,212 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-12 19:11:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2022-07-12 19:11:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:41,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145524139] [2022-07-12 19:11:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:41,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:41,231 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-12 19:11:41,232 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-12 19:11:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:41,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:11:41,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:41,385 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-12 19:11:41,401 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-12 19:11:41,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:41,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:41,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145524139] [2022-07-12 19:11:41,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145524139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:41,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:41,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:11:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667079802] [2022-07-12 19:11:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:41,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:11:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:41,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:11:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:11:41,428 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-12 19:11:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:41,695 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-07-12 19:11:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:11:41,697 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-12 19:11:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:41,703 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:11:41,703 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:11:41,704 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-12 19:11:41,707 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:41,708 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.2s Time] [2022-07-12 19:11:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:11:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-12 19:11:41,739 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-12 19:11:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-12 19:11:41,742 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2022-07-12 19:11:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:41,743 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-12 19:11:41,743 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-12 19:11:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-12 19:11:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:11:41,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:41,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:11:41,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:11:41,954 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-12 19:11:41,955 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-12 19:11:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2022-07-12 19:11:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:41,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710784227] [2022-07-12 19:11:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:41,959 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-12 19:11:41,961 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-12 19:11:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:42,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:11:42,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:42,054 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-12 19:11:42,079 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-12 19:11:42,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:42,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:42,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710784227] [2022-07-12 19:11:42,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710784227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:42,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:42,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:11:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132019304] [2022-07-12 19:11:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:42,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:11:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:11:42,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:11:42,092 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-12 19:11:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:42,372 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-07-12 19:11:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:11:42,373 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-12 19:11:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:42,374 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:11:42,374 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:11:42,375 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-12 19:11:42,376 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:42,376 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.3s Time] [2022-07-12 19:11:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:11:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:11:42,386 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-12 19:11:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-12 19:11:42,391 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2022-07-12 19:11:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:42,391 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-12 19:11:42,391 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-12 19:11:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-12 19:11:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:11:42,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:42,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:11:42,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 19:11:42,598 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-12 19:11:42,599 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-12 19:11:42,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2022-07-12 19:11:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:42,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725113739] [2022-07-12 19:11:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:42,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:42,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:42,602 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-12 19:11:42,604 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-12 19:11:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:42,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:11:42,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:42,717 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-12 19:11:42,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:42,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:42,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725113739] [2022-07-12 19:11:42,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725113739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:42,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:42,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:11:42,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934263169] [2022-07-12 19:11:42,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:42,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:11:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:42,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:11:42,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:11:42,720 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-12 19:11:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:42,731 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-12 19:11:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:11:42,732 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-12 19:11:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:42,734 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:11:42,734 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:11:42,734 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-12 19:11:42,735 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-12 19:11:42,735 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-12 19:11:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:11:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2022-07-12 19:11:42,744 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-12 19:11:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-07-12 19:11:42,746 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2022-07-12 19:11:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:42,746 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-07-12 19:11:42,746 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-12 19:11:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-07-12 19:11:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:11:42,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:42,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:11:42,756 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-12 19:11:42,953 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-12 19:11:42,954 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-12 19:11:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2022-07-12 19:11:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:42,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595278399] [2022-07-12 19:11:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:42,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:42,962 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-12 19:11:42,965 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-12 19:11:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:43,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:11:43,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:43,080 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-12 19:11:43,115 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-12 19:11:43,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:43,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:43,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595278399] [2022-07-12 19:11:43,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595278399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:43,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:43,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:11:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421128794] [2022-07-12 19:11:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:43,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:11:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:11:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:11:43,119 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-12 19:11:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:43,633 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-07-12 19:11:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:11:43,634 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-12 19:11:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:43,636 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:11:43,637 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:11:43,637 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-12 19:11:43,638 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 20 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:43,638 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.5s Time] [2022-07-12 19:11:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:11:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-07-12 19:11:43,645 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-12 19:11:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-07-12 19:11:43,647 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-07-12 19:11:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:43,647 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-07-12 19:11:43,647 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-12 19:11:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-07-12 19:11:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:11:43,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:43,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:11:43,662 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-12 19:11:43,858 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-12 19:11:43,859 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-12 19:11:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:43,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2022-07-12 19:11:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577448739] [2022-07-12 19:11:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:43,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:43,863 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-12 19:11:43,864 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-12 19:11:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:44,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:11:44,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:44,017 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-12 19:11:44,130 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-12 19:11:44,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:44,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:44,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577448739] [2022-07-12 19:11:44,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577448739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:44,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:44,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:11:44,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408649452] [2022-07-12 19:11:44,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:44,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:11:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:44,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:11:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:11:44,133 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-12 19:11:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:44,614 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-07-12 19:11:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:11:44,618 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-12 19:11:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:44,619 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:11:44,619 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:11:44,619 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-12 19:11:44,620 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:44,620 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.5s Time] [2022-07-12 19:11:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:11:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-07-12 19:11:44,627 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-12 19:11:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-12 19:11:44,628 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2022-07-12 19:11:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:44,628 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-12 19:11:44,628 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-12 19:11:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-12 19:11:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:11:44,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:44,629 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-12 19:11:44,642 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-12 19:11:44,839 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-12 19:11:44,839 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-12 19:11:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2022-07-12 19:11:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:44,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154921744] [2022-07-12 19:11:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:44,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:44,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:44,841 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-12 19:11:44,842 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-12 19:11:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:44,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:11:44,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:44,974 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-12 19:11:45,177 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:11:45,178 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-12 19:11:45,195 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-12 19:11:45,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:45,392 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-12 19:11:45,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:45,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154921744] [2022-07-12 19:11:45,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154921744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:45,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:45,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-12 19:11:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976910240] [2022-07-12 19:11:45,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:45,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:11:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:11:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:11:45,395 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-12 19:11:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:45,918 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-07-12 19:11:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:11:45,919 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-12 19:11:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:45,920 INFO L225 Difference]: With dead ends: 135 [2022-07-12 19:11:45,920 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 19:11:45,920 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-12 19:11:45,921 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:45,921 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.5s Time] [2022-07-12 19:11:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 19:11:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-12 19:11:45,927 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-12 19:11:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-12 19:11:45,929 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 26 [2022-07-12 19:11:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:45,929 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-12 19:11:45,929 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-12 19:11:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-12 19:11:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:11:45,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:45,930 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-12 19:11:45,943 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-12 19:11:46,141 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-12 19:11:46,141 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-12 19:11:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2022-07-12 19:11:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:46,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454227683] [2022-07-12 19:11:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:46,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:46,144 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-12 19:11:46,146 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-12 19:11:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:46,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:11:46,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:46,302 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-12 19:11:46,308 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-12 19:11:46,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:46,542 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-12 19:11:46,552 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:11:46,552 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-12 19:11:46,583 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-12 19:11:46,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:48,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454227683] [2022-07-12 19:11:48,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454227683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:48,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [759246673] [2022-07-12 19:11:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:11:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:11:48,873 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-12 19:11:48,880 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-12 19:11:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:49,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:11:49,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:49,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:11:49,137 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-12 19:11:49,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:49,329 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-12 19:11:49,338 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:11:49,338 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-12 19:11:49,354 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-12 19:11:49,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:49,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [759246673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:49,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:49,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 19:11:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44570262] [2022-07-12 19:11:49,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:49,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:11:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:11:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:11:49,521 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-12 19:11:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:50,157 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-07-12 19:11:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:11:50,157 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-12 19:11:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:50,158 INFO L225 Difference]: With dead ends: 135 [2022-07-12 19:11:50,158 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 19:11:50,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:11:50,159 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:50,159 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.6s Time] [2022-07-12 19:11:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 19:11:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-12 19:11:50,164 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-12 19:11:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2022-07-12 19:11:50,165 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 26 [2022-07-12 19:11:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:50,165 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2022-07-12 19:11:50,165 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-12 19:11:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2022-07-12 19:11:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:11:50,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:50,166 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-12 19:11:50,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-12 19:11:50,379 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-12 19:11:50,569 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-12 19:11:50,570 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-12 19:11:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2022-07-12 19:11:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:50,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611379674] [2022-07-12 19:11:50,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:50,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:50,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:50,572 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-12 19:11:50,574 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-12 19:11:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:50,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:11:50,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:50,721 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-12 19:11:50,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:50,763 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-12 19:11:50,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:50,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611379674] [2022-07-12 19:11:50,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611379674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:50,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:50,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 19:11:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747307526] [2022-07-12 19:11:50,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:50,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:11:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:11:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:11:50,765 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-12 19:11:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:50,914 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-07-12 19:11:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:11:50,915 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-12 19:11:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:50,916 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:11:50,916 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:11:50,916 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-12 19:11:50,917 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-12 19:11:50,917 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-12 19:11:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:11:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-12 19:11:50,921 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-12 19:11:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-07-12 19:11:50,921 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 28 [2022-07-12 19:11:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:50,922 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-07-12 19:11:50,922 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-12 19:11:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-07-12 19:11:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:11:50,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:50,923 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-12 19:11:50,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 19:11:51,133 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-12 19:11:51,133 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-12 19:11:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2022-07-12 19:11:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657821926] [2022-07-12 19:11:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:51,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:51,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:51,135 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-12 19:11:51,138 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-12 19:11:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:51,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:11:51,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:51,288 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-12 19:11:51,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:51,303 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:11:51,304 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-12 19:11:51,325 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-12 19:11:51,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:51,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657821926] [2022-07-12 19:11:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657821926] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:51,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:51,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-12 19:11:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202044815] [2022-07-12 19:11:51,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:51,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:11:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:11:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:11:51,328 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-12 19:11:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:51,533 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2022-07-12 19:11:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:11:51,535 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-12 19:11:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:51,536 INFO L225 Difference]: With dead ends: 138 [2022-07-12 19:11:51,536 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 19:11:51,536 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-12 19:11:51,537 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 19:11:51,537 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-12 19:11:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 19:11:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-12 19:11:51,541 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-12 19:11:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-07-12 19:11:51,542 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 29 [2022-07-12 19:11:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:51,543 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-07-12 19:11:51,543 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-12 19:11:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-07-12 19:11:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:11:51,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:51,544 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-12 19:11:51,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 19:11:51,751 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-12 19:11:51,751 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-12 19:11:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2022-07-12 19:11:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:51,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558967352] [2022-07-12 19:11:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:51,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:51,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:51,754 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-12 19:11:51,756 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-12 19:11:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:51,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:11:51,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:51,983 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-12 19:11:51,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:52,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:11:52,064 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-12 19:11:52,447 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-12 19:11:52,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:52,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558967352] [2022-07-12 19:11:52,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558967352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:52,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:52,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-12 19:11:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430784922] [2022-07-12 19:11:52,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:52,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:11:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:11:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:11:52,449 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-12 19:11:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:53,368 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-07-12 19:11:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:11:53,370 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-12 19:11:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:53,370 INFO L225 Difference]: With dead ends: 143 [2022-07-12 19:11:53,370 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 19:11:53,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:11:53,371 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:53,371 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.9s Time] [2022-07-12 19:11:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 19:11:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-12 19:11:53,375 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-12 19:11:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-07-12 19:11:53,375 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 29 [2022-07-12 19:11:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:53,376 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-07-12 19:11:53,376 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-12 19:11:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-07-12 19:11:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:11:53,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:53,377 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-12 19:11:53,390 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-12 19:11:53,587 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-12 19:11:53,587 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-12 19:11:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2022-07-12 19:11:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:53,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338065241] [2022-07-12 19:11:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:53,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:53,590 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-12 19:11:53,591 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-12 19:11:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:53,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:11:53,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:53,733 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-12 19:11:53,777 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-12 19:11:53,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:53,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:53,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338065241] [2022-07-12 19:11:53,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338065241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:53,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:53,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:11:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705734856] [2022-07-12 19:11:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:53,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:11:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:53,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:11:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:11:53,779 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-12 19:11:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:54,316 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-07-12 19:11:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:54,317 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-12 19:11:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:54,317 INFO L225 Difference]: With dead ends: 136 [2022-07-12 19:11:54,318 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:11:54,318 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-12 19:11:54,318 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:54,319 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.5s Time] [2022-07-12 19:11:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:11:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-12 19:11:54,322 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-12 19:11:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2022-07-12 19:11:54,323 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 30 [2022-07-12 19:11:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:54,323 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2022-07-12 19:11:54,323 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-12 19:11:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2022-07-12 19:11:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:11:54,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:54,324 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-12 19:11:54,335 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-12 19:11:54,534 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-12 19:11:54,534 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-12 19:11:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2022-07-12 19:11:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:54,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087463107] [2022-07-12 19:11:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:54,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:54,536 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-12 19:11:54,538 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-12 19:11:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:54,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 19:11:54,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:54,673 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-12 19:11:54,787 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-12 19:11:54,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:11:54,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:54,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087463107] [2022-07-12 19:11:54,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087463107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:11:54,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:11:54,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:11:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352174568] [2022-07-12 19:11:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:11:54,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:11:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:11:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:11:54,789 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-12 19:11:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:55,293 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-07-12 19:11:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:11:55,294 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-12 19:11:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:55,295 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:11:55,295 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:11:55,295 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-12 19:11:55,296 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:11:55,296 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.5s Time] [2022-07-12 19:11:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:11:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-12 19:11:55,300 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-12 19:11:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2022-07-12 19:11:55,301 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 30 [2022-07-12 19:11:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:55,301 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2022-07-12 19:11:55,301 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-12 19:11:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-07-12 19:11:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:11:55,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:55,302 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-12 19:11:55,315 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-12 19:11:55,512 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-12 19:11:55,513 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-12 19:11:55,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2022-07-12 19:11:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:55,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45337564] [2022-07-12 19:11:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:55,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:55,515 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-12 19:11:55,517 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-12 19:11:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:55,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:11:55,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:55,703 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-12 19:11:55,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:55,751 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-12 19:11:55,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:55,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45337564] [2022-07-12 19:11:55,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45337564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:11:55,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:55,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 19:11:55,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516320086] [2022-07-12 19:11:55,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:55,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:11:55,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:55,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:11:55,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:11:55,754 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-12 19:11:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:11:55,774 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-07-12 19:11:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:11:55,775 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-12 19:11:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:11:55,776 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:11:55,776 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:11:55,776 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-12 19:11:55,777 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-12 19:11:55,777 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-12 19:11:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:11:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-12 19:11:55,780 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-12 19:11:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-07-12 19:11:55,780 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 41 [2022-07-12 19:11:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:11:55,781 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-07-12 19:11:55,781 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-12 19:11:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-07-12 19:11:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:11:55,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:11:55,782 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-12 19:11:55,803 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-12 19:11:55,992 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-12 19:11:55,994 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-12 19:11:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:11:55,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2022-07-12 19:11:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:11:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804719674] [2022-07-12 19:11:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:11:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:11:55,997 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-12 19:11:56,000 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-12 19:11:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:56,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:11:56,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:56,289 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-12 19:11:56,305 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-12 19:11:56,414 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:11:56,414 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-12 19:11:56,435 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-12 19:11:56,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:56,519 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-12 19:11:56,714 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:11:56,715 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-12 19:11:56,747 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-12 19:11:56,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:56,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:11:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804719674] [2022-07-12 19:11:56,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804719674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [287119931] [2022-07-12 19:11:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:11:56,982 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:11:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:11:56,983 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-12 19:11:56,984 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-12 19:11:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:11:57,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:11:57,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:11:57,314 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:11:57,315 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-12 19:11:57,359 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:11:57,359 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-12 19:11:57,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:57,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:57,458 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:11:57,459 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-12 19:11:57,540 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:11:57,541 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-12 19:11:57,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:57,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:57,754 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:11:57,754 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-12 19:11:58,087 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:11:58,087 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-12 19:11:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:58,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:11:58,172 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:11:58,172 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-12 19:11:58,280 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-12 19:11:58,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:11:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [287119931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:11:58,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:11:58,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2022-07-12 19:11:58,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998330576] [2022-07-12 19:11:58,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:11:58,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:11:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:11:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:11:58,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:11:58,362 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-12 19:12:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:07,940 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-07-12 19:12:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:12:07,941 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-12 19:12:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:07,941 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:12:07,941 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:12:07,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2022-07-12 19:12:07,942 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-12 19:12:07,943 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-12 19:12:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:12:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-12 19:12:07,949 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-12 19:12:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2022-07-12 19:12:07,949 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 43 [2022-07-12 19:12:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:07,950 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2022-07-12 19:12:07,950 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-12 19:12:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-07-12 19:12:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:12:07,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:07,951 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-12 19:12:07,958 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-12 19:12:08,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 19:12:08,355 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-12 19:12:08,355 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-12 19:12:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195672, now seen corresponding path program 1 times [2022-07-12 19:12:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215028232] [2022-07-12 19:12:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:08,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:08,358 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-12 19:12:08,359 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-12 19:12:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:08,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:12:08,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:08,647 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-12 19:12:08,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:12:08,671 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-12 19:12:08,675 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-12 19:12:10,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:10,841 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-12 19:12:10,853 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:12:10,853 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-12 19:12:10,914 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-12 19:12:13,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:13,087 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-12 19:12:13,505 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:12:13,505 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-12 19:12:13,649 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-12 19:12:13,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:13,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215028232] [2022-07-12 19:12:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215028232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [838739539] [2022-07-12 19:12:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:12:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:12:13,970 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-12 19:12:13,971 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-12 19:12:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:14,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:12:14,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:14,307 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-12 19:12:14,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:12:14,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:14,428 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-12 19:12:14,528 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-12 19:12:16,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:16,789 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-12 19:12:17,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:12:17,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:17,276 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-12 19:12:17,298 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-12 19:12:17,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:18,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [838739539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:18,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:12:18,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-12 19:12:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748271104] [2022-07-12 19:12:18,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:12:18,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:12:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:12:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=434, Unknown=3, NotChecked=0, Total=506 [2022-07-12 19:12:18,569 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-12 19:12:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:21,730 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2022-07-12 19:12:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:12:21,731 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-12 19:12:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:21,732 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:12:21,732 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:12:21,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=112, Invalid=696, Unknown=4, NotChecked=0, Total=812 [2022-07-12 19:12:21,733 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-12 19:12:21,733 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-12 19:12:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:12:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-12 19:12:21,736 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-12 19:12:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-07-12 19:12:21,736 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 43 [2022-07-12 19:12:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:21,737 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-07-12 19:12:21,737 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-12 19:12:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-07-12 19:12:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:12:21,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:21,738 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-12 19:12:21,745 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-12 19:12:21,951 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-12 19:12:22,142 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-12 19:12:22,143 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-12 19:12:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1946956456, now seen corresponding path program 1 times [2022-07-12 19:12:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:22,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687760550] [2022-07-12 19:12:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:22,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:22,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:22,145 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-12 19:12:22,147 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-12 19:12:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:22,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:12:22,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:22,334 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-12 19:12:22,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:22,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:22,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687760550] [2022-07-12 19:12:22,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687760550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:22,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:22,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:12:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009523023] [2022-07-12 19:12:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:22,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:12:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:12:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:12:22,336 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-12 19:12:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:22,511 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-07-12 19:12:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:12:22,511 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-12 19:12:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:22,512 INFO L225 Difference]: With dead ends: 142 [2022-07-12 19:12:22,512 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 19:12:22,513 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-12 19:12:22,513 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-12 19:12:22,513 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-12 19:12:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 19:12:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-07-12 19:12:22,516 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-12 19:12:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-07-12 19:12:22,517 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 45 [2022-07-12 19:12:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:22,517 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-07-12 19:12:22,517 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-12 19:12:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-07-12 19:12:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:12:22,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:22,518 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-12 19:12:22,529 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-12 19:12:22,723 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-12 19:12:22,723 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-12 19:12:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1946956457, now seen corresponding path program 1 times [2022-07-12 19:12:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:22,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690661807] [2022-07-12 19:12:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:22,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:22,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:22,728 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-12 19:12:22,730 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-12 19:12:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:22,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:12:22,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:22,964 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-12 19:12:22,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:22,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:22,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690661807] [2022-07-12 19:12:22,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690661807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:22,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:22,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:12:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921150652] [2022-07-12 19:12:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:22,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:12:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:12:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:12:22,966 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-12 19:12:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:23,140 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-07-12 19:12:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:12:23,140 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-12 19:12:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:23,141 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:12:23,141 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:12:23,141 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-12 19:12:23,142 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:23,142 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.1s Time] [2022-07-12 19:12:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:12:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:12:23,145 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-12 19:12:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-07-12 19:12:23,146 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 45 [2022-07-12 19:12:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:23,146 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-07-12 19:12:23,146 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-12 19:12:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-07-12 19:12:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:12:23,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:23,147 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-12 19:12:23,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-12 19:12:23,355 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-12 19:12:23,355 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-12 19:12:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 226108014, now seen corresponding path program 1 times [2022-07-12 19:12:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182514509] [2022-07-12 19:12:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:23,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:23,357 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-12 19:12:23,367 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-12 19:12:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:23,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:12:23,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:23,568 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-12 19:12:23,610 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-12 19:12:23,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:23,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:23,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182514509] [2022-07-12 19:12:23,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182514509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:23,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:23,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:12:23,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395504652] [2022-07-12 19:12:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:23,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:12:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:23,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:12:23,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:12:23,613 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-12 19:12:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:24,083 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-07-12 19:12:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:12:24,084 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-12 19:12:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:24,085 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:12:24,085 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:12:24,085 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-12 19:12:24,085 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-12 19:12:24,086 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-12 19:12:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:12:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-07-12 19:12:24,088 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-12 19:12:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-07-12 19:12:24,089 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 46 [2022-07-12 19:12:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:24,089 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-07-12 19:12:24,090 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-12 19:12:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-07-12 19:12:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:12:24,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:24,090 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-12 19:12:24,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:12:24,295 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-12 19:12:24,295 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-12 19:12:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash 226108015, now seen corresponding path program 1 times [2022-07-12 19:12:24,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:24,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609668717] [2022-07-12 19:12:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:24,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:24,297 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-12 19:12:24,298 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-12 19:12:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:24,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:12:24,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:24,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-12 19:12:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:12:24,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:24,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609668717] [2022-07-12 19:12:24,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609668717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:24,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:24,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:12:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989741886] [2022-07-12 19:12:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:24,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:12:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:24,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:12:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:12:24,584 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-12 19:12:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:25,067 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-07-12 19:12:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:12:25,068 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-12 19:12:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:25,068 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:12:25,068 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:12:25,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:12:25,069 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:25,069 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.5s Time] [2022-07-12 19:12:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:12:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 19:12:25,071 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-12 19:12:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-07-12 19:12:25,072 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 46 [2022-07-12 19:12:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:25,072 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-07-12 19:12:25,073 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-12 19:12:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-07-12 19:12:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:12:25,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:25,073 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-12 19:12:25,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:12:25,284 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-12 19:12:25,284 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-12 19:12:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:25,285 INFO L85 PathProgramCache]: Analyzing trace with hash 226118937, now seen corresponding path program 1 times [2022-07-12 19:12:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:25,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005119848] [2022-07-12 19:12:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:25,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:25,286 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-12 19:12:25,287 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-12 19:12:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:25,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:12:25,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:25,662 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-12 19:12:25,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 19:12:26,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:26,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 19:12:26,342 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:12:26,343 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 24 treesize of output 35 [2022-07-12 19:12:26,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 19:12:26,598 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-12 19:12:26,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:26,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005119848] [2022-07-12 19:12:26,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005119848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254790483] [2022-07-12 19:12:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:12:26,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:12:26,856 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-12 19:12:26,859 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-12 19:12:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:27,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:12:27,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:27,369 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-12 19:12:27,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 19:12:28,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:28,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 19 treesize of output 21 [2022-07-12 19:12:28,208 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:12:28,208 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 24 treesize of output 35 [2022-07-12 19:12:28,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-12 19:12:28,385 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-12 19:12:28,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:28,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [254790483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:28,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:12:28,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-07-12 19:12:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706358240] [2022-07-12 19:12:28,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:12:28,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:12:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:12:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=860, Unknown=3, NotChecked=0, Total=992 [2022-07-12 19:12:28,532 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 30 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 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-12 19:12:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:29,611 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-07-12 19:12:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:12:29,612 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 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-12 19:12:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:29,612 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:12:29,612 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:12:29,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=240, Invalid=1474, Unknown=8, NotChecked=0, Total=1722 [2022-07-12 19:12:29,613 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:29,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 707 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 386 Invalid, 0 Unknown, 167 Unchecked, 0.6s Time] [2022-07-12 19:12:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:12:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2022-07-12 19:12:29,616 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-12 19:12:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-07-12 19:12:29,617 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 46 [2022-07-12 19:12:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:29,617 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-07-12 19:12:29,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.740740740740741) internal successors, (74), 26 states have internal predecessors, (74), 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-12 19:12:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-07-12 19:12:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:12:29,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:29,618 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-12 19:12:29,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-07-12 19:12:29,839 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-12 19:12:30,029 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-12 19:12:30,030 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-12 19:12:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash 226118938, now seen corresponding path program 1 times [2022-07-12 19:12:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:30,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340998838] [2022-07-12 19:12:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:30,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:30,032 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-12 19:12:30,033 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-12 19:12:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:30,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 19:12:30,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:30,581 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-12 19:12:30,589 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-12 19:12:30,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, 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-12 19:12:30,952 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-12 19:12:31,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 19:12:31,204 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-12 19:12:31,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:31,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-12 19:12:31,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:31,675 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-12 19:12:31,701 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:12:31,701 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 18 treesize of output 18 [2022-07-12 19:12:31,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:31,719 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-12 19:12:31,902 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-12 19:12:31,909 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-12 19:12:31,980 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-12 19:12:31,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:32,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:32,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340998838] [2022-07-12 19:12:32,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340998838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:32,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1227636089] [2022-07-12 19:12:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:32,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:12:32,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:12:32,516 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-12 19:12:32,517 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-12 19:12:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:32,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:12:32,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:33,092 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-12 19:12:33,101 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-12 19:12:33,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 19:12:33,772 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-12 19:12:34,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:34,259 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-12 19:12:34,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:34,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-12 19:12:34,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:34,308 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-12 19:12:34,331 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:12:34,332 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 18 treesize of output 18 [2022-07-12 19:12:34,490 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-12 19:12:34,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:12:34,507 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-12 19:12:34,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:35,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1227636089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:35,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:12:35,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2022-07-12 19:12:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711013465] [2022-07-12 19:12:35,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:12:35,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 19:12:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:35,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 19:12:35,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1102, Unknown=8, NotChecked=0, Total=1260 [2022-07-12 19:12:35,551 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-12 19:12:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:37,620 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-07-12 19:12:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:12:37,620 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-12 19:12:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:37,621 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:12:37,621 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:12:37,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=275, Invalid=1873, Unknown=14, NotChecked=0, Total=2162 [2022-07-12 19:12:37,623 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 53 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:37,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 776 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 661 Invalid, 0 Unknown, 127 Unchecked, 1.1s Time] [2022-07-12 19:12:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:12:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2022-07-12 19:12:37,628 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-12 19:12:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-07-12 19:12:37,628 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 46 [2022-07-12 19:12:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:37,629 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-07-12 19:12:37,629 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-12 19:12:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-07-12 19:12:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:12:37,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:37,630 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-12 19:12:37,641 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-12 19:12:37,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 19:12:38,035 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-12 19:12:38,036 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-12 19:12:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1475150796, now seen corresponding path program 1 times [2022-07-12 19:12:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86511807] [2022-07-12 19:12:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:38,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:38,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:38,038 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-12 19:12:38,040 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-12 19:12:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:38,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:12:38,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:38,274 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-12 19:12:38,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:38,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:38,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86511807] [2022-07-12 19:12:38,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86511807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:38,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:38,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:12:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380265936] [2022-07-12 19:12:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:38,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:12:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:12:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:12:38,276 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-12 19:12:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:38,446 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-07-12 19:12:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:12:38,446 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-12 19:12:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:38,447 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:12:38,447 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:12:38,448 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-12 19:12:38,448 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-12 19:12:38,448 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-12 19:12:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:12:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-12 19:12:38,451 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-12 19:12:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-07-12 19:12:38,452 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 49 [2022-07-12 19:12:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-07-12 19:12:38,452 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-12 19:12:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-07-12 19:12:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:12:38,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:38,453 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-12 19:12:38,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-12 19:12:38,664 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-12 19:12:38,666 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-12 19:12:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1475150797, now seen corresponding path program 1 times [2022-07-12 19:12:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652618121] [2022-07-12 19:12:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:38,668 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-12 19:12:38,671 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-12 19:12:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:38,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:12:38,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:38,994 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-12 19:12:38,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:38,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:38,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652618121] [2022-07-12 19:12:38,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652618121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:38,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:38,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:12:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947705947] [2022-07-12 19:12:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:38,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:12:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:12:38,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:12:38,996 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-12 19:12:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:39,167 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2022-07-12 19:12:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:12:39,168 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-12 19:12:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:39,169 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:12:39,169 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:12:39,169 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-12 19:12:39,170 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-12 19:12:39,170 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-12 19:12:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:12:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 19:12:39,172 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-12 19:12:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-07-12 19:12:39,173 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 49 [2022-07-12 19:12:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:39,173 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-07-12 19:12:39,173 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-12 19:12:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-07-12 19:12:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:12:39,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:39,174 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-12 19:12:39,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-12 19:12:39,383 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-12 19:12:39,383 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-12 19:12:39,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 280709232, now seen corresponding path program 1 times [2022-07-12 19:12:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:39,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132145214] [2022-07-12 19:12:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:39,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:39,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:39,386 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-12 19:12:39,388 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-12 19:12:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:39,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:12:39,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:40,058 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-12 19:12:40,113 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-12 19:12:40,189 WARN L855 $PredicateComparison]: unable to prove that (and (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_2098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2098)))) is different from true [2022-07-12 19:12:40,199 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2099))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-12 19:12:40,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:40,281 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-12 19:12:40,350 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-12 19:12:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-12 19:12:40,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:40,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132145214] [2022-07-12 19:12:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132145214] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [631240828] [2022-07-12 19:12:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:40,505 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:12:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:12:40,508 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-12 19:12:40,515 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-12 19:12:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:40,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:12:40,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:41,364 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-12 19:12:41,448 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2210) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-12 19:12:41,461 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2211) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-12 19:12:41,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:41,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-12 19:12:41,654 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-12 19:12:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-12 19:12:41,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [631240828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:41,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:12:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2022-07-12 19:12:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665964041] [2022-07-12 19:12:41,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:12:41,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 19:12:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 19:12:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=739, Unknown=17, NotChecked=236, Total=1122 [2022-07-12 19:12:41,776 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 32 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 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-12 19:12:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:42,821 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-07-12 19:12:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:12:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 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-12 19:12:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:42,822 INFO L225 Difference]: With dead ends: 117 [2022-07-12 19:12:42,822 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 19:12:42,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=244, Invalid=1306, Unknown=26, NotChecked=316, Total=1892 [2022-07-12 19:12:42,823 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 56 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:42,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1358 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 424 Invalid, 0 Unknown, 475 Unchecked, 0.6s Time] [2022-07-12 19:12:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 19:12:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2022-07-12 19:12:42,825 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-12 19:12:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-07-12 19:12:42,825 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 51 [2022-07-12 19:12:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:42,825 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-07-12 19:12:42,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 28 states have internal predecessors, (79), 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-12 19:12:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-07-12 19:12:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:12:42,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:42,826 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-12 19:12:42,836 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-12 19:12:43,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-07-12 19:12:43,226 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-12 19:12:43,227 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-12 19:12:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 869466270, now seen corresponding path program 1 times [2022-07-12 19:12:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:43,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592664601] [2022-07-12 19:12:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:43,229 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-12 19:12:43,229 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-12 19:12:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:43,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:12:43,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:43,527 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-12 19:12:43,552 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-12 19:12:43,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:43,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:43,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592664601] [2022-07-12 19:12:43,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592664601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:43,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:43,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:12:43,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854663389] [2022-07-12 19:12:43,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:43,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:12:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:43,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:12:43,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:12:43,554 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-12 19:12:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:44,064 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-07-12 19:12:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:12:44,064 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-12 19:12:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:44,065 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:12:44,065 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 19:12:44,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:12:44,065 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 50 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:44,065 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.5s Time] [2022-07-12 19:12:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 19:12:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-07-12 19:12:44,067 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-12 19:12:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-07-12 19:12:44,068 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 52 [2022-07-12 19:12:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:44,068 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-07-12 19:12:44,069 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-12 19:12:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-07-12 19:12:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:12:44,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:44,069 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-12 19:12:44,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-12 19:12:44,279 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-12 19:12:44,279 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-12 19:12:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 869466271, now seen corresponding path program 1 times [2022-07-12 19:12:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:44,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249487373] [2022-07-12 19:12:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:44,281 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-12 19:12:44,282 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-12 19:12:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:44,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:12:44,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:44,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 19:12:44,587 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-12 19:12:44,671 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-12 19:12:44,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:12:44,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:44,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249487373] [2022-07-12 19:12:44,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249487373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:12:44,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:12:44,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:12:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470771284] [2022-07-12 19:12:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:12:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:12:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:12:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:12:44,673 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-12 19:12:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:45,335 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-07-12 19:12:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:12:45,336 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-12 19:12:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:45,336 INFO L225 Difference]: With dead ends: 99 [2022-07-12 19:12:45,336 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 19:12:45,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:12:45,337 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:45,337 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.5s Time] [2022-07-12 19:12:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 19:12:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-12 19:12:45,339 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-12 19:12:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-07-12 19:12:45,340 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 52 [2022-07-12 19:12:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:45,340 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-07-12 19:12:45,340 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-12 19:12:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-07-12 19:12:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:12:45,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:45,341 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-12 19:12:45,352 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-12 19:12:45,552 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-12 19:12:45,552 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-12 19:12:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650644, now seen corresponding path program 1 times [2022-07-12 19:12:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:45,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286844865] [2022-07-12 19:12:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:45,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:45,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:45,555 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-12 19:12:45,556 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-12 19:12:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:45,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 19:12:45,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:46,042 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-12 19:12:46,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:12:46,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:12:46,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 19:12:46,528 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:12:46,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 19:12:46,535 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-12 19:12:46,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:46,950 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:12:46,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-07-12 19:12:46,993 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-12 19:12:46,993 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 37 treesize of output 66 [2022-07-12 19:12:47,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:47,008 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-12 19:12:47,182 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-12 19:12:47,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:12:47,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 42 [2022-07-12 19:12:47,651 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-12 19:12:47,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:48,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:12:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286844865] [2022-07-12 19:12:48,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286844865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:48,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [156493524] [2022-07-12 19:12:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:48,092 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:12:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:12:48,093 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-12 19:12:48,094 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-12 19:12:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:48,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 19:12:48,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:48,907 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-12 19:12:49,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:12:49,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:12:49,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2022-07-12 19:12:49,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:12:50,322 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-12 19:12:50,322 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 37 treesize of output 66 [2022-07-12 19:12:50,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:50,351 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:12:50,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2022-07-12 19:12:50,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:50,369 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-12 19:12:50,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:12:50,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:50,765 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:12:50,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 36 [2022-07-12 19:12:51,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:12:51,325 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-12 19:12:51,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:12:51,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [156493524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:12:51,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:12:51,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2022-07-12 19:12:51,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345469192] [2022-07-12 19:12:51,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:12:51,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 19:12:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:12:51,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 19:12:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2145, Unknown=18, NotChecked=0, Total=2352 [2022-07-12 19:12:51,757 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-12 19:12:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:12:53,702 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-07-12 19:12:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:12:53,703 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-12 19:12:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:12:53,703 INFO L225 Difference]: With dead ends: 98 [2022-07-12 19:12:53,703 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 19:12:53,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=326, Invalid=3810, Unknown=24, NotChecked=0, Total=4160 [2022-07-12 19:12:53,705 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:12:53,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 747 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 441 Invalid, 0 Unknown, 377 Unchecked, 0.8s Time] [2022-07-12 19:12:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 19:12:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 19:12:53,706 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-12 19:12:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-07-12 19:12:53,707 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 53 [2022-07-12 19:12:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:12:53,707 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-07-12 19:12:53,707 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-12 19:12:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-07-12 19:12:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:12:53,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:12:53,708 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-12 19:12:53,724 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-12 19:12:53,926 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-12 19:12:54,121 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-12 19:12:54,121 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-12 19:12:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:12:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650645, now seen corresponding path program 1 times [2022-07-12 19:12:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:12:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553926397] [2022-07-12 19:12:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:12:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:12:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:12:54,123 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-12 19:12:54,124 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-12 19:12:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:12:54,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 19:12:54,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:12:54,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:54,572 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-12 19:12:54,605 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-12 19:12:54,798 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:12:54,798 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-12 19:12:55,208 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:12:55,209 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-12 19:12:55,251 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-12 19:12:55,252 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-12 19:12:55,684 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-12 19:12:55,707 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-12 19:12:56,049 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-12 19:12:56,050 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 88 treesize of output 52 [2022-07-12 19:12:56,074 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:12:56,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 19:12:56,085 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 23 treesize of output 17 [2022-07-12 19:12:56,097 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-12 19:12:56,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:56,670 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:12:56,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 76 [2022-07-12 19:12:56,736 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-12 19:12:56,736 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 40 treesize of output 44 [2022-07-12 19:12:56,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:12:56,770 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:12:56,770 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-12 19:12:56,785 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-12 19:12:57,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:12:57,374 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-12 19:12:57,374 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-12 19:12:57,404 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-12 19:12:57,404 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-12 19:12:57,706 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-12 19:12:57,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:13:02,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:13:02,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553926397] [2022-07-12 19:13:02,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553926397] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:13:02,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1405164280] [2022-07-12 19:13:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:13:02,948 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:13:02,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:13:02,949 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-12 19:13:02,950 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-12 19:13:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:13:03,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 19:13:03,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:13:03,875 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-12 19:13:03,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:13:04,792 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:13:04,792 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 20 treesize of output 27 [2022-07-12 19:13:04,820 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-12 19:13:05,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:13:05,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 19:13:06,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:13:06,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2022-07-12 19:13:06,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:13:06,231 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-12 19:13:07,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:07,036 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-12 19:13:07,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:07,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:07,053 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:13:07,053 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-12 19:13:07,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:07,078 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:13:07,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2022-07-12 19:13:07,105 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-12 19:13:07,105 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 33 treesize of output 35 [2022-07-12 19:13:07,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:13:07,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:07,661 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:13:07,662 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-12 19:13:08,104 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-12 19:13:08,104 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-12 19:13:08,451 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-12 19:13:08,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:13:09,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1405164280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:13:09,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:13:09,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 52 [2022-07-12 19:13:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601647932] [2022-07-12 19:13:09,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:13:09,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 19:13:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:13:09,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 19:13:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3175, Unknown=23, NotChecked=0, Total=3422 [2022-07-12 19:13:09,404 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-12 19:13:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:13:13,778 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-07-12 19:13:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:13:13,779 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-12 19:13:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:13:13,780 INFO L225 Difference]: With dead ends: 97 [2022-07-12 19:13:13,780 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 19:13:13,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=436, Invalid=5849, Unknown=35, NotChecked=0, Total=6320 [2022-07-12 19:13:13,781 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 43 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:13:13,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 858 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 557 Invalid, 0 Unknown, 346 Unchecked, 1.0s Time] [2022-07-12 19:13:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 19:13:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-12 19:13:13,783 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-12 19:13:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-07-12 19:13:13,783 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 53 [2022-07-12 19:13:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:13:13,784 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-07-12 19:13:13,784 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-12 19:13:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-07-12 19:13:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:13:13,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:13:13,784 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-12 19:13:13,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2022-07-12 19:13:13,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-12 19:13:14,185 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-12 19:13:14,185 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-12 19:13:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:13:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -939292314, now seen corresponding path program 1 times [2022-07-12 19:13:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:13:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059038444] [2022-07-12 19:13:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:13:14,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:13:14,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:13:14,187 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-12 19:13:14,188 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-12 19:13:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:13:14,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 19:13:14,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:13:14,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:14,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 19:13:14,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:14,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 19:13:14,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:14,809 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-12 19:13:14,809 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-12 19:13:14,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:13:15,238 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-12 19:13:15,477 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:13:15,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2022-07-12 19:13:15,499 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-12 19:13:15,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 19:13:16,013 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:13:16,014 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-12 19:13:16,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:13:16,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:16,054 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:13:16,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2022-07-12 19:13:16,086 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:13:16,086 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 24 treesize of output 35 [2022-07-12 19:13:16,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:13:17,201 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-12 19:13:17,201 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-12 19:13:17,370 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:13:17,371 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-12 19:13:17,377 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-12 19:13:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:17,525 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-12 19:13:17,531 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-12 19:13:17,851 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-12 19:13:18,169 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:13:18,169 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-12 19:13:18,688 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-12 19:13:18,909 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-12 19:13:18,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:13:19,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_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-12 19:13:19,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_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-12 19:13:20,008 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 (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3061) (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 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-12 19:13:20,440 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 (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3061) (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) v_ArrVal_3062)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| (_ bv4 32))) v_ArrVal_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-12 19:13:21,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:13:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059038444] [2022-07-12 19:13:21,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059038444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:13:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349527870] [2022-07-12 19:13:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:13:21,552 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:13:21,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:13:21,553 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-12 19:13:21,554 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-12 19:13:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:13:22,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 19:13:22,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:13:23,063 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-12 19:13:23,863 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-12 19:13:24,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:13:24,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 18 [2022-07-12 19:13:24,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 19:13:24,551 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-12 19:13:24,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:24,900 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:13:24,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-07-12 19:13:24,932 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:13:24,933 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 24 treesize of output 35 [2022-07-12 19:13:24,985 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:13:24,985 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-12 19:13:24,997 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-12 19:13:28,138 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-12 19:13:29,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:13:29,582 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-12 19:13:30,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:30,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:30,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, 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-12 19:13:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:30,619 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-12 19:13:30,630 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-12 19:13:31,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:31,739 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-12 19:13:32,250 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:13:32,250 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-12 19:13:32,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-12 19:13:32,799 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-12 19:13:32,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:13:32,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3208) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-12 19:13:32,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3207) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3208) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:13:32,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_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_3208) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-12 19:13:34,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [349527870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:13:34,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:13:34,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 58 [2022-07-12 19:13:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898540599] [2022-07-12 19:13:34,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:13:34,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 19:13:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:13:34,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 19:13:34,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=4579, Unknown=54, NotChecked=1008, Total=6006 [2022-07-12 19:13:34,095 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-12 19:13:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:13:38,757 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-07-12 19:13:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 19:13:38,758 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-12 19:13:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:13:38,759 INFO L225 Difference]: With dead ends: 98 [2022-07-12 19:13:38,759 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 19:13:38,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2351 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=549, Invalid=7076, Unknown=59, NotChecked=1246, Total=8930 [2022-07-12 19:13:38,761 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:13:38,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1040 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 699 Invalid, 0 Unknown, 413 Unchecked, 1.8s Time] [2022-07-12 19:13:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 19:13:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 19:13:38,763 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-12 19:13:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-07-12 19:13:38,764 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 58 [2022-07-12 19:13:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:13:38,764 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-07-12 19:13:38,764 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-12 19:13:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-07-12 19:13:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:13:38,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:13:38,765 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-12 19:13:38,778 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-12 19:13:38,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2022-07-12 19:13:39,167 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-12 19:13:39,168 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-12 19:13:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:13:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -939292313, now seen corresponding path program 1 times [2022-07-12 19:13:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:13:39,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326001547] [2022-07-12 19:13:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:13:39,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:13:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:13:39,170 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-12 19:13:39,170 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-12 19:13:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:13:39,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-12 19:13:39,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:13:39,793 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-12 19:13:39,817 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-12 19:13:39,960 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:13:39,960 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-12 19:13:40,039 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-12 19:13:40,494 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-12 19:13:40,777 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:13:40,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2022-07-12 19:13:40,787 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-12 19:13:40,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 19:13:40,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:13:41,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:41,497 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:13:41,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2022-07-12 19:13:41,517 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:13:41,518 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 18 treesize of output 18 [2022-07-12 19:13:41,579 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:13:41,580 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-12 19:13:41,588 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-12 19:13:43,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:13:43,173 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-07-12 19:13:43,173 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-12 19:13:43,182 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-12 19:13:43,444 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:13:43,445 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-12 19:13:43,451 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-12 19:13:43,521 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:13:43,522 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-12 19:13:43,534 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-12 19:13:43,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:43,681 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-12 19:13:43,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:43,696 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-12 19:13:43,702 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-12 19:13:43,835 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-12 19:13:43,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 19:13:43,988 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:13:43,988 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-12 19:13:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:13:43,999 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-12 19:13:44,171 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-12 19:13:44,178 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-12 19:13:44,422 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-12 19:13:44,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:13:44,900 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-12 19:13:44,933 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-12 19:13:45,057 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-12 19:13:46,686 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-12 19:13:49,146 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-12 19:13:51,641 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-12 19:13:52,188 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-12 19:13:52,691 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-12 19:13:52,904 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) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| (_ bv4 32))) v_ArrVal_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_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|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| (_ bv4 32))))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_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|))))))) is different from false [2022-07-12 19:14:50,060 WARN L233 SmtUtils]: Spent 10.43s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:14:53,538 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-12 19:14:58,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 260 [2022-07-12 19:15:10,746 WARN L233 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:15:10,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326001547] [2022-07-12 19:15:10,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326001547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [345369147] [2022-07-12 19:15:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:10,748 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:15:10,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:15:10,750 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-12 19:15:10,751 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-12 19:15:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:11,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-12 19:15:11,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:12,123 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-12 19:15:15,380 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-12 19:15:30,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:30,295 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-12 19:15:38,802 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-12 19:15:42,642 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