./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:40:27,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:40:27,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:40:27,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:40:27,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:40:27,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:40:27,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:40:27,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:40:27,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:40:27,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:40:27,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:40:27,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:40:27,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:40:27,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:40:27,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:40:27,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:40:27,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:40:27,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:40:27,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:40:27,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:40:27,412 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:40:27,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:40:27,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:40:27,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:40:27,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:40:27,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:40:27,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:40:27,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:40:27,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:40:27,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:40:27,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:40:27,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:40:27,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:40:27,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:40:27,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:40:27,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:40:27,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:40:27,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:40:27,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:40:27,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:40:27,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:40:27,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:40:27,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:40:27,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:40:27,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:40:27,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:40:27,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:40:27,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:40:27,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:40:27,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:40:27,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:40:27,452 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:40:27,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:40:27,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:40:27,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:40:27,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:40:27,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:40:27,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:40:27,454 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:40:27,454 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:40:27,455 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:40:27,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:40:27,455 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:40:27,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:40:27,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:40:27,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:40:27,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:40:27,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:40:27,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:40:27,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:40:27,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:40:27,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:40:27,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:40:27,458 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-07-21 17:40:27,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:40:27,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:40:27,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:40:27,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:40:27,749 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:40:27,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-07-21 17:40:27,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970e9c23f/c0565712791f41fbaa48da18ff1e059e/FLAGdb9f202df [2022-07-21 17:40:28,195 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:40:28,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-07-21 17:40:28,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970e9c23f/c0565712791f41fbaa48da18ff1e059e/FLAGdb9f202df [2022-07-21 17:40:28,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970e9c23f/c0565712791f41fbaa48da18ff1e059e [2022-07-21 17:40:28,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:40:28,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:40:28,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:40:28,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:40:28,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:40:28,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc1ab16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28, skipping insertion in model container [2022-07-21 17:40:28,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:40:28,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:40:28,471 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_append_unequal.i[24672,24685] [2022-07-21 17:40:28,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:40:28,492 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:40:28,535 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_append_unequal.i[24672,24685] [2022-07-21 17:40:28,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:40:28,564 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:40:28,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28 WrapperNode [2022-07-21 17:40:28,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:40:28,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:40:28,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:40:28,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:40:28,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,638 INFO L137 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-07-21 17:40:28,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:40:28,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:40:28,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:40:28,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:40:28,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:40:28,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:40:28,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:40:28,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:40:28,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (1/1) ... [2022-07-21 17:40:28,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:40:28,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:28,725 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-21 17:40:28,731 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-21 17:40:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:40:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:40:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:40:28,756 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:40:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:40:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:40:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:40:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:40:28,841 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:40:28,842 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:40:29,156 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:40:29,160 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:40:29,161 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 17:40:29,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:40:29 BoogieIcfgContainer [2022-07-21 17:40:29,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:40:29,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:40:29,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:40:29,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:40:29,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:40:28" (1/3) ... [2022-07-21 17:40:29,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6854fc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:40:29, skipping insertion in model container [2022-07-21 17:40:29,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:28" (2/3) ... [2022-07-21 17:40:29,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6854fc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:40:29, skipping insertion in model container [2022-07-21 17:40:29,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:40:29" (3/3) ... [2022-07-21 17:40:29,168 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-07-21 17:40:29,177 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:40:29,177 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-21 17:40:29,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:40:29,222 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@510ddf2c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@665642d7 [2022-07-21 17:40:29,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-21 17:40:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:40:29,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:29,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:40:29,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-07-21 17:40:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:29,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052563651] [2022-07-21 17:40:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:29,411 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-21 17:40:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:29,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052563651] [2022-07-21 17:40:29,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052563651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:29,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:29,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:40:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734519086] [2022-07-21 17:40:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:29,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:40:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:40:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:40:29,441 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:40:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:29,577 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-21 17:40:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:40:29,579 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-21 17:40:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:29,585 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:40:29,585 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 17:40:29,586 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-21 17:40:29,588 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:29,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:40:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 17:40:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-21 17:40:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-21 17:40:29,620 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-07-21 17:40:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:29,621 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-21 17:40:29,621 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-21 17:40:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-21 17:40:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:40:29,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:29,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:40:29,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:40:29,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-07-21 17:40:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:29,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236678040] [2022-07-21 17:40:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:29,657 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-21 17:40:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:29,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236678040] [2022-07-21 17:40:29,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236678040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:29,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:29,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:40:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545904771] [2022-07-21 17:40:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:29,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:40:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:40:29,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:40:29,660 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:40:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:29,728 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-21 17:40:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:40:29,728 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-21 17:40:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:29,729 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:40:29,730 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:40:29,730 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-21 17:40:29,731 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:29,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:40:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:40:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 17:40:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-21 17:40:29,752 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-07-21 17:40:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:29,752 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-21 17:40:29,752 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-21 17:40:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-21 17:40:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:40:29,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:29,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:40:29,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:40:29,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:29,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-07-21 17:40:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:29,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655966202] [2022-07-21 17:40:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:29,861 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-21 17:40:29,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:29,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655966202] [2022-07-21 17:40:29,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655966202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:29,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:29,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:40:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961984727] [2022-07-21 17:40:29,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:29,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:40:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:40:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:40:29,864 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:40:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:29,973 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-21 17:40:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:40:29,974 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-21 17:40:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:29,975 INFO L225 Difference]: With dead ends: 140 [2022-07-21 17:40:29,982 INFO L226 Difference]: Without dead ends: 140 [2022-07-21 17:40:29,983 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-21 17:40:29,983 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:29,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:40:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-21 17:40:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-07-21 17:40:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-21 17:40:29,993 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-07-21 17:40:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:29,993 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-21 17:40:29,994 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-21 17:40:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-21 17:40:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:40:29,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:29,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:40:29,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:40:29,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-07-21 17:40:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:29,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209707144] [2022-07-21 17:40:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,178 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-21 17:40:30,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:30,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209707144] [2022-07-21 17:40:30,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209707144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:30,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:30,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:40:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528365144] [2022-07-21 17:40:30,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:30,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:40:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:40:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:40:30,180 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:30,413 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-21 17:40:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:30,413 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-21 17:40:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:30,415 INFO L225 Difference]: With dead ends: 130 [2022-07-21 17:40:30,415 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 17:40:30,415 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-21 17:40:30,416 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:30,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 17:40:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-21 17:40:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-21 17:40:30,424 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-07-21 17:40:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:30,424 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-21 17:40:30,424 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-21 17:40:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-21 17:40:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:40:30,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:30,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:40:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:40:30,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-07-21 17:40:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639001561] [2022-07-21 17:40:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,519 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-21 17:40:30,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:30,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639001561] [2022-07-21 17:40:30,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639001561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:30,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:30,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:40:30,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735228405] [2022-07-21 17:40:30,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:30,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:40:30,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:30,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:40:30,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:40:30,521 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:30,748 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-21 17:40:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:30,749 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-21 17:40:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:30,751 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:40:30,752 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:40:30,752 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-21 17:40:30,758 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:30,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:40:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-21 17:40:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-07-21 17:40:30,775 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-07-21 17:40:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:30,776 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-07-21 17:40:30,776 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-21 17:40:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-07-21 17:40:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:40:30,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:30,777 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-21 17:40:30,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:40:30,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-07-21 17:40:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:30,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369845907] [2022-07-21 17:40:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:30,908 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-21 17:40:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369845907] [2022-07-21 17:40:30,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369845907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122756989] [2022-07-21 17:40:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:30,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:30,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:30,924 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-21 17:40:30,951 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-21 17:40:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:31,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 17:40:31,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:31,076 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-21 17:40:31,276 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:40:31,277 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-21 17:40:31,288 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-21 17:40:31,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:31,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122756989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:31,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:31,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-21 17:40:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387233578] [2022-07-21 17:40:31,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:31,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:40:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:31,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:40:31,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:40:31,336 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:40:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:31,585 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2022-07-21 17:40:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:31,585 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-21 17:40:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:31,586 INFO L225 Difference]: With dead ends: 153 [2022-07-21 17:40:31,586 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 17:40:31,587 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-21 17:40:31,587 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:31,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 404 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 453 Invalid, 0 Unknown, 4 Unchecked, 0.2s Time] [2022-07-21 17:40:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 17:40:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2022-07-21 17:40:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-21 17:40:31,593 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-07-21 17:40:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:31,593 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-21 17:40:31,593 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-21 17:40:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-21 17:40:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:40:31,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:31,594 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-21 17:40:31,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 17:40:31,811 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-21 17:40:31,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-07-21 17:40:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:31,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308836858] [2022-07-21 17:40:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:31,950 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-21 17:40:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308836858] [2022-07-21 17:40:31,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308836858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529947365] [2022-07-21 17:40:31,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:31,953 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-21 17:40:31,954 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-21 17:40:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:32,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:40:32,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:32,055 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-21 17:40:32,291 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:40:32,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:40:32,314 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:40:32,314 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-21 17:40:32,376 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-21 17:40:32,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:32,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529947365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:32,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:32,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-21 17:40:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790799590] [2022-07-21 17:40:32,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:32,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 17:40:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 17:40:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-07-21 17:40:32,479 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:40:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:33,014 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-21 17:40:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:40:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-07-21 17:40:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:33,015 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:40:33,015 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 17:40:33,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-21 17:40:33,016 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:33,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 986 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 828 Invalid, 0 Unknown, 166 Unchecked, 0.4s Time] [2022-07-21 17:40:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 17:40:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-21 17:40:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-21 17:40:33,042 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-07-21 17:40:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:33,042 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-21 17:40:33,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:40:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-21 17:40:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:40:33,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:33,043 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-21 17:40:33,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 17:40:33,255 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-21 17:40:33,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-07-21 17:40:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:33,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783084517] [2022-07-21 17:40:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,380 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-21 17:40:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:33,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783084517] [2022-07-21 17:40:33,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783084517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:33,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508832430] [2022-07-21 17:40:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:33,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:33,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:33,396 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-21 17:40:33,397 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-21 17:40:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:40:33,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:33,523 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-21 17:40:33,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:33,569 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-21 17:40:33,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508832430] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:33,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:40:33,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-21 17:40:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207742934] [2022-07-21 17:40:33,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:33,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:40:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:40:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:40:33,571 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:40:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:33,680 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-21 17:40:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:33,680 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-21 17:40:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:33,681 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:40:33,681 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:40:33,681 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-21 17:40:33,682 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:33,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:40:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:40:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-21 17:40:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-21 17:40:33,686 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-07-21 17:40:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:33,686 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-21 17:40:33,686 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-21 17:40:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-21 17:40:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:40:33,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:33,687 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-21 17:40:33,706 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-21 17:40:33,904 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-21 17:40:33,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-07-21 17:40:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:33,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882713805] [2022-07-21 17:40:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:33,990 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-21 17:40:33,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882713805] [2022-07-21 17:40:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882713805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186211912] [2022-07-21 17:40:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:34,008 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-21 17:40:34,009 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-21 17:40:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:34,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:40:34,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:34,119 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-21 17:40:34,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:34,126 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:40:34,126 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-21 17:40:34,139 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-21 17:40:34,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186211912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:34,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:40:34,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-21 17:40:34,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992176521] [2022-07-21 17:40:34,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:34,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:40:34,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:40:34,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:40:34,141 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:40:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:34,292 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-07-21 17:40:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:34,293 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-21 17:40:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:34,294 INFO L225 Difference]: With dead ends: 138 [2022-07-21 17:40:34,294 INFO L226 Difference]: Without dead ends: 138 [2022-07-21 17:40:34,294 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-21 17:40:34,294 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 13 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:34,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 311 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:40:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-21 17:40:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-21 17:40:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-21 17:40:34,298 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-07-21 17:40:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:34,298 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-21 17:40:34,298 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-21 17:40:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-21 17:40:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:40:34,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:34,299 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-21 17:40:34,337 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-21 17:40:34,517 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-21 17:40:34,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-07-21 17:40:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867641152] [2022-07-21 17:40:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:34,603 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-21 17:40:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:34,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867641152] [2022-07-21 17:40:34,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867641152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:34,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87372854] [2022-07-21 17:40:34,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:34,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:34,605 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-21 17:40:34,618 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-21 17:40:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:34,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 17:40:34,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:34,818 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-21 17:40:34,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:34,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:40:34,843 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-21 17:40:34,932 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-21 17:40:34,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87372854] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:34,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:40:34,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-21 17:40:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749434716] [2022-07-21 17:40:34,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:34,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:40:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:40:34,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:40:34,934 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-21 17:40:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:35,122 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-21 17:40:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:40:35,123 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-21 17:40:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:35,123 INFO L225 Difference]: With dead ends: 143 [2022-07-21 17:40:35,123 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 17:40:35,124 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-21 17:40:35,124 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:35,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1352 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 17:40:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-21 17:40:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-21 17:40:35,127 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-07-21 17:40:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:35,127 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-21 17:40:35,127 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-21 17:40:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-21 17:40:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:40:35,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:35,128 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-21 17:40:35,148 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-21 17:40:35,339 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-21 17:40:35,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-07-21 17:40:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:35,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903149758] [2022-07-21 17:40:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:35,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:35,402 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-21 17:40:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903149758] [2022-07-21 17:40:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903149758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:35,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:35,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:40:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945820144] [2022-07-21 17:40:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:35,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:40:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:40:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:40:35,404 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:35,653 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-21 17:40:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:40:35,653 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-21 17:40:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:35,654 INFO L225 Difference]: With dead ends: 136 [2022-07-21 17:40:35,654 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 17:40:35,654 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-21 17:40:35,655 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 23 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:35,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 475 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 17:40:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-21 17:40:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-21 17:40:35,658 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-07-21 17:40:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:35,658 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-21 17:40:35,658 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-21 17:40:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-21 17:40:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:40:35,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:35,659 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-21 17:40:35,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:40:35,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-07-21 17:40:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:35,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393016265] [2022-07-21 17:40:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:35,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:35,776 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-21 17:40:35,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393016265] [2022-07-21 17:40:35,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393016265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:35,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:35,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:40:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546853319] [2022-07-21 17:40:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:35,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:40:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:40:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:40:35,779 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:36,011 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-21 17:40:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:40:36,011 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-21 17:40:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:36,012 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:40:36,012 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:40:36,013 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-21 17:40:36,013 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:36,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:40:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-21 17:40:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-21 17:40:36,016 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-07-21 17:40:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:36,016 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-21 17:40:36,016 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-21 17:40:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-21 17:40:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:40:36,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:36,017 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-21 17:40:36,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:40:36,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-07-21 17:40:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433611138] [2022-07-21 17:40:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 17:40:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,090 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-21 17:40:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:36,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433611138] [2022-07-21 17:40:36,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433611138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:36,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743307760] [2022-07-21 17:40:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:36,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:36,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:36,092 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-21 17:40:36,108 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-21 17:40:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:40:36,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:36,290 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-21 17:40:36,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743307760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:36,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:40:36,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-21 17:40:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861346410] [2022-07-21 17:40:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:36,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:40:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:40:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:40:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:40:36,292 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:40:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:36,302 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-21 17:40:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:40:36,302 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-21 17:40:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:36,303 INFO L225 Difference]: With dead ends: 122 [2022-07-21 17:40:36,303 INFO L226 Difference]: Without dead ends: 122 [2022-07-21 17:40:36,303 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-21 17:40:36,304 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:36,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 153 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:40:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-21 17:40:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-21 17:40:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-07-21 17:40:36,308 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-07-21 17:40:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:36,309 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-07-21 17:40:36,310 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-21 17:40:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-07-21 17:40:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:40:36,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:36,313 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-21 17:40:36,343 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-21 17:40:36,543 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-21 17:40:36,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-07-21 17:40:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:40:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665726275] [2022-07-21 17:40:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:40:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:40:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 17:40:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 17:40:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,754 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-21 17:40:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:40:36,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665726275] [2022-07-21 17:40:36,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665726275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:36,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178196489] [2022-07-21 17:40:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:40:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:36,756 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-21 17:40:36,758 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-21 17:40:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:36,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 17:40:36,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:36,946 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-21 17:40:36,957 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-21 17:40:37,070 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:40:37,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 17:40:37,271 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-21 17:40:37,272 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 91857 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-21 17:40:37,274 INFO L158 Benchmark]: Toolchain (without parser) took 9055.52ms. Allocated memory was 73.4MB in the beginning and 144.7MB in the end (delta: 71.3MB). Free memory was 53.7MB in the beginning and 49.6MB in the end (delta: 4.1MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2022-07-21 17:40:37,274 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 54.0MB in the end (delta: 35.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:40:37,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.02ms. Allocated memory is still 73.4MB. Free memory was 53.6MB in the beginning and 47.7MB in the end (delta: 5.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-21 17:40:37,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.42ms. Allocated memory is still 73.4MB. Free memory was 47.7MB in the beginning and 45.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:40:37,275 INFO L158 Benchmark]: Boogie Preprocessor took 53.58ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 43.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:40:37,275 INFO L158 Benchmark]: RCFGBuilder took 468.73ms. Allocated memory is still 73.4MB. Free memory was 43.3MB in the beginning and 40.6MB in the end (delta: 2.7MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-07-21 17:40:37,275 INFO L158 Benchmark]: TraceAbstraction took 8110.10ms. Allocated memory was 73.4MB in the beginning and 144.7MB in the end (delta: 71.3MB). Free memory was 40.3MB in the beginning and 49.6MB in the end (delta: -9.3MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2022-07-21 17:40:37,276 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 54.0MB in the end (delta: 35.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.02ms. Allocated memory is still 73.4MB. Free memory was 53.6MB in the beginning and 47.7MB in the end (delta: 5.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.42ms. Allocated memory is still 73.4MB. Free memory was 47.7MB in the beginning and 45.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.58ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 43.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.73ms. Allocated memory is still 73.4MB. Free memory was 43.3MB in the beginning and 40.6MB in the end (delta: 2.7MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8110.10ms. Allocated memory was 73.4MB in the beginning and 144.7MB in the end (delta: 71.3MB). Free memory was 40.3MB in the beginning and 49.6MB in the end (delta: -9.3MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 91857 column 46: unknown constant v_#valid_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 91857 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-21 17:40:37,294 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_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:40:39,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:40:39,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:40:39,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:40:39,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:40:39,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:40:39,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:40:39,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:40:39,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:40:39,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:40:39,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:40:39,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:40:39,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:40:39,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:40:39,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:40:39,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:40:39,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:40:39,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:40:39,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:40:39,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:40:39,197 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:40:39,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:40:39,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:40:39,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:40:39,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:40:39,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:40:39,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:40:39,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:40:39,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:40:39,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:40:39,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:40:39,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:40:39,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:40:39,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:40:39,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:40:39,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:40:39,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:40:39,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:40:39,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:40:39,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:40:39,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:40:39,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:40:39,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:40:39,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:40:39,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:40:39,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:40:39,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:40:39,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:40:39,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:40:39,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:40:39,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:40:39,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:40:39,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:40:39,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:40:39,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:40:39,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:40:39,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:40:39,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:40:39,261 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:40:39,261 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:40:39,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:40:39,261 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-07-21 17:40:39,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:40:39,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:40:39,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:40:39,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:40:39,552 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:40:39,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-07-21 17:40:39,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174ffbd55/f7ad930a80164dc2914d86e6ad5dacf6/FLAG4fed2060a [2022-07-21 17:40:40,026 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:40:40,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-07-21 17:40:40,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174ffbd55/f7ad930a80164dc2914d86e6ad5dacf6/FLAG4fed2060a [2022-07-21 17:40:40,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174ffbd55/f7ad930a80164dc2914d86e6ad5dacf6 [2022-07-21 17:40:40,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:40:40,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:40:40,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:40:40,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:40:40,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:40:40,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0a3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40, skipping insertion in model container [2022-07-21 17:40:40,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:40:40,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:40:40,398 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_append_unequal.i[24672,24685] [2022-07-21 17:40:40,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:40:40,412 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:40:40,446 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_append_unequal.i[24672,24685] [2022-07-21 17:40:40,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:40:40,482 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:40:40,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40 WrapperNode [2022-07-21 17:40:40,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:40:40,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:40:40,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:40:40,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:40:40,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,550 INFO L137 Inliner]: procedures = 130, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 153 [2022-07-21 17:40:40,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:40:40,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:40:40,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:40:40,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:40:40,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:40:40,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:40:40,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:40:40,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:40:40,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (1/1) ... [2022-07-21 17:40:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:40:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:40:40,641 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-21 17:40:40,643 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-21 17:40:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:40:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:40:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:40:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:40:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:40:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:40:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:40:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:40:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:40:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:40:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:40:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:40:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:40:40,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:40:40,835 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:40:40,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:40:41,428 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:40:41,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:40:41,434 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 17:40:41,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:40:41 BoogieIcfgContainer [2022-07-21 17:40:41,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:40:41,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:40:41,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:40:41,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:40:41,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:40:40" (1/3) ... [2022-07-21 17:40:41,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edaf702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:40:41, skipping insertion in model container [2022-07-21 17:40:41,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:40:40" (2/3) ... [2022-07-21 17:40:41,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edaf702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:40:41, skipping insertion in model container [2022-07-21 17:40:41,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:40:41" (3/3) ... [2022-07-21 17:40:41,442 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-07-21 17:40:41,455 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:40:41,456 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-07-21 17:40:41,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:40:41,511 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@51bd01ba, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49fea46a [2022-07-21 17:40:41,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-07-21 17:40:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:40:41,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:41,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:40:41,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-07-21 17:40:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:41,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642361464] [2022-07-21 17:40:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:41,543 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-21 17:40:41,546 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-21 17:40:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:41,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:40:41,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:41,667 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-21 17:40:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:40:41,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:41,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:41,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642361464] [2022-07-21 17:40:41,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642361464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:41,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:41,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:40:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581662111] [2022-07-21 17:40:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:41,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:40:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:40:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:40:41,702 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:40:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:41,901 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-21 17:40:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:40:41,904 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-21 17:40:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:41,909 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:40:41,909 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 17:40:41,910 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-21 17:40:41,920 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:41,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 17:40:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-21 17:40:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-07-21 17:40:41,985 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-07-21 17:40:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:41,985 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-07-21 17:40:41,986 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-21 17:40:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-07-21 17:40:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:40:41,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:41,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:40:42,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 17:40:42,193 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-21 17:40:42,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-07-21 17:40:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512608955] [2022-07-21 17:40:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:42,219 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-21 17:40:42,220 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-21 17:40:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:42,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:40:42,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:42,291 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-21 17:40:42,303 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-21 17:40:42,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:42,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:42,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512608955] [2022-07-21 17:40:42,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512608955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:42,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:42,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:40:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980868882] [2022-07-21 17:40:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:42,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:40:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:42,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:40:42,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:40:42,306 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:40:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:42,489 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-21 17:40:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:40:42,490 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-21 17:40:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:42,490 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:40:42,491 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:40:42,491 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-21 17:40:42,491 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:42,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:40:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 17:40:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-21 17:40:42,497 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-07-21 17:40:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:42,497 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-21 17:40:42,497 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-21 17:40:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-21 17:40:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:40:42,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:42,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:40:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:40:42,704 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-21 17:40:42,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-07-21 17:40:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:42,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915707496] [2022-07-21 17:40:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:42,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:42,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:42,707 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-21 17:40:42,709 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-21 17:40:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:42,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:40:42,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:42,777 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-21 17:40:42,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:42,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915707496] [2022-07-21 17:40:42,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915707496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:42,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:42,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:40:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183022861] [2022-07-21 17:40:42,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:42,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:40:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:40:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:40:42,780 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:40:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:42,787 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-21 17:40:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:40:42,788 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-21 17:40:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:42,789 INFO L225 Difference]: With dead ends: 140 [2022-07-21 17:40:42,789 INFO L226 Difference]: Without dead ends: 140 [2022-07-21 17:40:42,789 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-21 17:40:42,790 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:42,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 269 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:40:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-21 17:40:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-07-21 17:40:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-21 17:40:42,805 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-07-21 17:40:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:42,805 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-21 17:40:42,806 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-21 17:40:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-21 17:40:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:40:42,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:42,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:40:42,820 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-21 17:40:43,020 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-21 17:40:43,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-07-21 17:40:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:43,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021558402] [2022-07-21 17:40:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:43,023 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-21 17:40:43,028 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-21 17:40:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:43,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:40:43,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:43,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:40:43,203 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-21 17:40:43,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:43,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:43,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021558402] [2022-07-21 17:40:43,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021558402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:43,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:43,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:40:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227138736] [2022-07-21 17:40:43,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:43,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:40:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:40:43,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:40:43,209 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:43,650 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-21 17:40:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:40:43,651 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-21 17:40:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:43,653 INFO L225 Difference]: With dead ends: 130 [2022-07-21 17:40:43,653 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 17:40:43,653 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-21 17:40:43,654 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 20 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:43,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 386 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:40:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 17:40:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-21 17:40:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-21 17:40:43,659 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-07-21 17:40:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:43,660 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-21 17:40:43,660 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-21 17:40:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-21 17:40:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:40:43,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:43,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:40:43,671 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-21 17:40:43,870 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-21 17:40:43,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-07-21 17:40:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:43,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008573847] [2022-07-21 17:40:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:43,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:43,873 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-21 17:40:43,875 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-21 17:40:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:43,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:40:43,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:43,980 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-21 17:40:44,066 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-21 17:40:44,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:44,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:44,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008573847] [2022-07-21 17:40:44,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008573847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:44,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:44,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:40:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175749244] [2022-07-21 17:40:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:44,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:40:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:40:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:40:44,069 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:44,522 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-07-21 17:40:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:40:44,523 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-21 17:40:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:44,524 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:40:44,524 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:40:44,524 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-21 17:40:44,524 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:44,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 410 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:40:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:40:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-21 17:40:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-07-21 17:40:44,530 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-07-21 17:40:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:44,530 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-07-21 17:40:44,530 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-21 17:40:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-07-21 17:40:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:40:44,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:44,531 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-21 17:40:44,543 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-21 17:40:44,740 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-21 17:40:44,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-07-21 17:40:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:44,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288086095] [2022-07-21 17:40:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:44,743 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-21 17:40:44,745 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-21 17:40:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:44,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:40:44,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:44,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:40:45,025 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:40:45,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-21 17:40:45,038 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-21 17:40:45,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:45,208 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-21 17:40:45,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288086095] [2022-07-21 17:40:45,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288086095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:45,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:45,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-21 17:40:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976910240] [2022-07-21 17:40:45,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:45,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:40:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:40:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:40:45,210 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:40:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:45,565 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-21 17:40:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:45,565 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-21 17:40:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:45,566 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:40:45,566 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 17:40:45,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:40:45,567 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:45,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 496 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 86 Unchecked, 0.3s Time] [2022-07-21 17:40:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 17:40:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-21 17:40:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-21 17:40:45,580 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-07-21 17:40:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:45,580 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-21 17:40:45,580 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-21 17:40:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-21 17:40:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:40:45,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:45,582 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-21 17:40:45,595 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-21 17:40:45,792 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-21 17:40:45,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-07-21 17:40:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:45,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454227683] [2022-07-21 17:40:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:45,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:45,796 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-21 17:40:45,797 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-21 17:40:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:45,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 17:40:45,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:45,920 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-21 17:40:45,923 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-21 17:40:46,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:46,202 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-21 17:40:46,209 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:40:46,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-21 17:40:46,249 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-21 17:40:46,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:48,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454227683] [2022-07-21 17:40:48,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454227683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [876481407] [2022-07-21 17:40:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:40:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:40:48,597 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-21 17:40:48,598 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-21 17:40:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:48,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 17:40:48,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:48,820 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-21 17:40:48,827 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-21 17:40:48,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:48,994 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-21 17:40:49,004 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:40:49,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-21 17:40:49,025 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-21 17:40:49,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:51,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [876481407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:51,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:51,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-21 17:40:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726317869] [2022-07-21 17:40:51,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:51,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:40:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:40:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-07-21 17:40:51,306 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:40:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:52,097 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-21 17:40:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:40:52,098 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-21 17:40:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:52,099 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:40:52,099 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 17:40:52,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2022-07-21 17:40:52,099 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 3 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:52,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 436 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 411 Invalid, 0 Unknown, 83 Unchecked, 0.7s Time] [2022-07-21 17:40:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 17:40:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-21 17:40:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-21 17:40:52,103 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-07-21 17:40:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:52,103 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-21 17:40:52,103 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-21 17:40:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-21 17:40:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:40:52,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:52,103 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-21 17:40:52,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:40:52,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 17:40:52,504 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-21 17:40:52,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-07-21 17:40:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:52,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174076997] [2022-07-21 17:40:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:52,509 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-21 17:40:52,510 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-21 17:40:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:52,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:40:52,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:52,665 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-21 17:40:52,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:52,711 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-21 17:40:52,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:52,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174076997] [2022-07-21 17:40:52,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174076997] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:52,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:52,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-21 17:40:52,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319703981] [2022-07-21 17:40:52,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:52,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:40:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:52,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:40:52,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:40:52,712 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:40:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:52,864 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-21 17:40:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:40:52,865 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-21 17:40:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:52,865 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:40:52,865 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:40:52,866 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-21 17:40:52,866 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:52,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 620 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:40:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:40:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-21 17:40:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-21 17:40:52,869 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-07-21 17:40:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:52,869 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-21 17:40:52,869 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-21 17:40:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-21 17:40:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:40:52,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:52,870 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-21 17:40:52,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:40:53,076 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-21 17:40:53,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-07-21 17:40:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:53,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073200403] [2022-07-21 17:40:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:53,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:53,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:53,079 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-21 17:40:53,087 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-21 17:40:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:53,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:40:53,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:53,206 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-21 17:40:53,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:53,221 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:40:53,222 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-21 17:40:53,240 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-21 17:40:53,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073200403] [2022-07-21 17:40:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073200403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:53,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:53,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-21 17:40:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866779810] [2022-07-21 17:40:53,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:53,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:40:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:40:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:40:53,241 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:40:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:53,475 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-07-21 17:40:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:40:53,476 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-21 17:40:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:53,477 INFO L225 Difference]: With dead ends: 138 [2022-07-21 17:40:53,477 INFO L226 Difference]: Without dead ends: 138 [2022-07-21 17:40:53,477 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-21 17:40:53,477 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:53,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 320 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:40:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-21 17:40:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-21 17:40:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-21 17:40:53,480 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-07-21 17:40:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:53,480 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-21 17:40:53,480 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-21 17:40:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-21 17:40:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:40:53,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:53,481 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-21 17:40:53,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:40:53,681 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-21 17:40:53,682 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-07-21 17:40:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:53,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954419456] [2022-07-21 17:40:53,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:53,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:53,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:53,708 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-21 17:40:53,710 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-21 17:40:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:53,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:40:53,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:53,918 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-21 17:40:53,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:53,993 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:40:53,993 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-21 17:40:54,404 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-21 17:40:54,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:54,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954419456] [2022-07-21 17:40:54,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954419456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:54,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:54,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-21 17:40:54,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428313411] [2022-07-21 17:40:54,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:40:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:40:54,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:40:54,405 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:40:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:55,120 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-21 17:40:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:40:55,121 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-21 17:40:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:55,122 INFO L225 Difference]: With dead ends: 143 [2022-07-21 17:40:55,122 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 17:40:55,122 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-21 17:40:55,123 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 24 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:55,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 931 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:40:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 17:40:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-21 17:40:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-21 17:40:55,125 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-07-21 17:40:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:55,125 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-21 17:40:55,126 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-21 17:40:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-21 17:40:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:40:55,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:55,127 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-21 17:40:55,136 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-21 17:40:55,327 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-21 17:40:55,327 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-07-21 17:40:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:55,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54783908] [2022-07-21 17:40:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:55,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:55,330 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-21 17:40:55,331 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-21 17:40:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:55,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:40:55,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:55,438 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-21 17:40:55,489 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-21 17:40:55,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:55,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54783908] [2022-07-21 17:40:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54783908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:55,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:55,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:40:55,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531688585] [2022-07-21 17:40:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:40:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:40:55,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:40:55,490 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:56,104 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-21 17:40:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:56,105 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-21 17:40:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:56,105 INFO L225 Difference]: With dead ends: 136 [2022-07-21 17:40:56,105 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 17:40:56,105 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-21 17:40:56,106 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:56,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 436 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 17:40:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 17:40:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-21 17:40:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-21 17:40:56,109 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-07-21 17:40:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:56,109 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-21 17:40:56,109 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-21 17:40:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-21 17:40:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:40:56,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:56,110 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-21 17:40:56,117 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-21 17:40:56,317 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-21 17:40:56,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-07-21 17:40:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:56,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875058671] [2022-07-21 17:40:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:56,320 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-21 17:40:56,321 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-21 17:40:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:56,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:40:56,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:56,452 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-21 17:40:56,552 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-21 17:40:56,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:40:56,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875058671] [2022-07-21 17:40:56,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875058671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:40:56,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:40:56,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:40:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919197551] [2022-07-21 17:40:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:40:56,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:40:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:40:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:40:56,554 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:40:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:57,089 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-21 17:40:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:40:57,090 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-21 17:40:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:57,097 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:40:57,097 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:40:57,097 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-21 17:40:57,098 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 20 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:57,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 466 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:40:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:40:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-21 17:40:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:40:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-21 17:40:57,100 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-07-21 17:40:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:57,101 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-21 17:40:57,101 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-21 17:40:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-21 17:40:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:40:57,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:57,101 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-21 17:40:57,110 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-21 17:40:57,304 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-21 17:40:57,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-07-21 17:40:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:57,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212625310] [2022-07-21 17:40:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:57,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:57,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:57,306 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-21 17:40:57,307 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-21 17:40:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:57,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:40:57,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:57,476 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-21 17:40:57,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:57,551 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-21 17:40:57,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:57,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212625310] [2022-07-21 17:40:57,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212625310] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:40:57,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:40:57,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 17:40:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506868529] [2022-07-21 17:40:57,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:40:57,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:40:57,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:40:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:40:57,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:40:57,554 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 17:40:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:40:57,579 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-21 17:40:57,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:40:57,580 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-21 17:40:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:40:57,581 INFO L225 Difference]: With dead ends: 122 [2022-07-21 17:40:57,581 INFO L226 Difference]: Without dead ends: 122 [2022-07-21 17:40:57,582 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-21 17:40:57,583 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 321 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:40:57,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 259 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:40:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-21 17:40:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-21 17:40:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:40:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-07-21 17:40:57,588 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-07-21 17:40:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:40:57,588 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-07-21 17:40:57,588 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-21 17:40:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-07-21 17:40:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:40:57,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:40:57,591 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-21 17:40:57,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-21 17:40:57,799 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-21 17:40:57,799 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:40:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:40:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-07-21 17:40:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:40:57,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88063221] [2022-07-21 17:40:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:40:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:40:57,802 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-21 17:40:57,803 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-21 17:40:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:58,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 17:40:58,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:58,023 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-21 17:40:58,051 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-21 17:40:58,210 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:40:58,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-21 17:40:58,249 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-21 17:40:58,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:58,333 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-21 17:40:58,568 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:40:58,568 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-21 17:40:58,613 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-21 17:40:58,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:40:58,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:40:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88063221] [2022-07-21 17:40:58,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88063221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:40:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1610653314] [2022-07-21 17:40:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:40:58,929 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:40:58,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:40:58,930 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-21 17:40:58,931 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-21 17:40:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:40:59,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:40:59,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:40:59,250 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:40:59,251 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-21 17:40:59,292 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:40:59,292 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-21 17:40:59,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:59,398 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:40:59,398 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-21 17:40:59,501 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:40:59,501 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-21 17:40:59,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:59,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:40:59,741 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:40:59,741 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-21 17:41:00,350 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:41:00,350 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-21 17:41:00,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:00,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:00,452 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:41:00,452 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-21 17:41:00,651 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-21 17:41:00,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1610653314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:00,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:00,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2022-07-21 17:41:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387142038] [2022-07-21 17:41:00,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:41:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:41:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:41:00,770 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:41:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:10,016 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-07-21 17:41:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:41:10,017 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-21 17:41:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:10,017 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:41:10,017 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:41:10,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-07-21 17:41:10,018 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 13 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:10,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 843 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 556 Unchecked, 0.4s Time] [2022-07-21 17:41:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:41:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 17:41:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.72) internal successors, (129), 123 states have internal predecessors, (129), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-07-21 17:41:10,022 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 43 [2022-07-21 17:41:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:10,025 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-07-21 17:41:10,025 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-21 17:41:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-07-21 17:41:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:41:10,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:10,026 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-21 17:41:10,038 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-21 17:41:10,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:10,438 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-21 17:41:10,438 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:10,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2022-07-21 17:41:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:10,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002240375] [2022-07-21 17:41:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:10,440 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-21 17:41:10,442 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-21 17:41:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:10,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:41:10,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:10,670 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-21 17:41:10,676 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-21 17:41:10,696 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-21 17:41:10,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:41:12,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:12,822 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-21 17:41:12,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:41:12,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-21 17:41:12,884 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-21 17:41:14,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:14,983 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-21 17:41:15,422 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:41:15,422 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-21 17:41:15,485 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-21 17:41:15,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:15,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002240375] [2022-07-21 17:41:15,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002240375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433591992] [2022-07-21 17:41:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:15,713 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:41:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:41:15,721 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-21 17:41:15,723 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-21 17:41:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:16,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:41:16,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:16,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-21 17:41:16,071 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-21 17:41:16,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:16,156 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-21 17:41:16,230 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-21 17:41:18,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:18,430 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-21 17:41:18,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-21 17:41:18,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:18,761 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-21 17:41:18,780 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-21 17:41:18,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:18,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [433591992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:18,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:18,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-21 17:41:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506500198] [2022-07-21 17:41:18,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:18,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:41:18,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:41:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=434, Unknown=3, NotChecked=0, Total=506 [2022-07-21 17:41:18,935 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 20 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:41:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:21,793 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-07-21 17:41:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:41:21,794 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-21 17:41:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:21,794 INFO L225 Difference]: With dead ends: 128 [2022-07-21 17:41:21,794 INFO L226 Difference]: Without dead ends: 128 [2022-07-21 17:41:21,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=112, Invalid=696, Unknown=4, NotChecked=0, Total=812 [2022-07-21 17:41:21,797 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 21 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:21,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 655 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 342 Unchecked, 0.4s Time] [2022-07-21 17:41:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-21 17:41:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-21 17:41:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 122 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2022-07-21 17:41:21,808 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 43 [2022-07-21 17:41:21,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:21,808 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2022-07-21 17:41:21,808 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-21 17:41:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-07-21 17:41:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:41:21,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:21,811 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-21 17:41:21,817 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-21 17:41:22,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-21 17:41:22,218 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-21 17:41:22,218 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2022-07-21 17:41:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:22,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73389367] [2022-07-21 17:41:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:22,220 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-21 17:41:22,230 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-21 17:41:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:22,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:41:22,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:22,421 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-21 17:41:22,458 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-21 17:41:22,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:22,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:22,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73389367] [2022-07-21 17:41:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73389367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:22,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:41:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362719529] [2022-07-21 17:41:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:41:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:41:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:41:22,460 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-21 17:41:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:22,825 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-07-21 17:41:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:41:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 45 [2022-07-21 17:41:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:22,826 INFO L225 Difference]: With dead ends: 142 [2022-07-21 17:41:22,826 INFO L226 Difference]: Without dead ends: 142 [2022-07-21 17:41:22,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-21 17:41:22,827 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 91 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:22,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 271 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:41:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-21 17:41:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-07-21 17:41:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 118 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2022-07-21 17:41:22,831 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 45 [2022-07-21 17:41:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:22,832 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2022-07-21 17:41:22,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-21 17:41:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-07-21 17:41:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:41:22,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:22,832 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-21 17:41:22,843 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-21 17:41:23,032 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-21 17:41:23,033 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2022-07-21 17:41:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:23,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591529757] [2022-07-21 17:41:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:23,036 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-21 17:41:23,036 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-21 17:41:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:23,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:41:23,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:23,232 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-21 17:41:23,295 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-21 17:41:23,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:23,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:23,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591529757] [2022-07-21 17:41:23,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591529757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:23,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:23,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:41:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030853127] [2022-07-21 17:41:23,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:23,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:41:23,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:41:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:41:23,296 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-21 17:41:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:23,680 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-07-21 17:41:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:41:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 45 [2022-07-21 17:41:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:23,681 INFO L225 Difference]: With dead ends: 120 [2022-07-21 17:41:23,681 INFO L226 Difference]: Without dead ends: 120 [2022-07-21 17:41:23,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-21 17:41:23,681 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:23,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 282 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:41:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-21 17:41:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-21 17:41:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 75 states have (on average 1.6) internal successors, (120), 114 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2022-07-21 17:41:23,684 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 45 [2022-07-21 17:41:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:23,684 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2022-07-21 17:41:23,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-21 17:41:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-07-21 17:41:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:41:23,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:23,684 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-21 17:41:23,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:23,885 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-21 17:41:23,885 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 656619412, now seen corresponding path program 1 times [2022-07-21 17:41:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82630974] [2022-07-21 17:41:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:23,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:23,887 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-21 17:41:23,888 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-21 17:41:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:24,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:41:24,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:24,092 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-21 17:41:24,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:24,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:24,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82630974] [2022-07-21 17:41:24,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82630974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:24,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:24,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:41:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215638928] [2022-07-21 17:41:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:24,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:41:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:41:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:41:24,093 INFO L87 Difference]: Start difference. First operand 120 states and 126 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-21 17:41:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:24,240 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-07-21 17:41:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:41:24,241 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-21 17:41:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:24,242 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:41:24,242 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:41:24,242 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-21 17:41:24,242 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 81 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 103 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:24,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:41:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:41:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-07-21 17:41:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 110 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2022-07-21 17:41:24,245 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 45 [2022-07-21 17:41:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:24,246 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2022-07-21 17:41:24,246 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-21 17:41:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-07-21 17:41:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:41:24,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:24,246 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-21 17:41:24,259 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-21 17:41:24,460 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-21 17:41:24,461 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash 656619413, now seen corresponding path program 1 times [2022-07-21 17:41:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:24,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287754426] [2022-07-21 17:41:24,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:24,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:24,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:24,463 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-21 17:41:24,464 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-21 17:41:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:24,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:41:24,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:24,691 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-21 17:41:24,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:24,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287754426] [2022-07-21 17:41:24,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287754426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:24,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:24,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:41:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008296875] [2022-07-21 17:41:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:24,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:41:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:41:24,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:41:24,693 INFO L87 Difference]: Start difference. First operand 116 states and 122 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-21 17:41:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:24,854 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-07-21 17:41:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:41:24,856 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-21 17:41:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:24,857 INFO L225 Difference]: With dead ends: 112 [2022-07-21 17:41:24,857 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 17:41:24,857 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-21 17:41:24,858 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 166 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 130 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:24,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 130 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:41:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 17:41:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-21 17:41:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 106 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2022-07-21 17:41:24,862 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 45 [2022-07-21 17:41:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:24,862 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2022-07-21 17:41:24,862 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-21 17:41:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2022-07-21 17:41:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:41:24,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:24,863 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-21 17:41:24,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-21 17:41:25,065 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-21 17:41:25,065 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:25,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2022-07-21 17:41:25,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:25,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473426808] [2022-07-21 17:41:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:25,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:25,067 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-21 17:41:25,069 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-21 17:41:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:25,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 17:41:25,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:25,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:41:25,526 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-21 17:41:25,582 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-21 17:41:25,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:25,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 17:41:25,833 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-21 17:41:25,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2022-07-21 17:41:25,914 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-21 17:41:25,951 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-21 17:41:25,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:26,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:26,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473426808] [2022-07-21 17:41:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473426808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1006691715] [2022-07-21 17:41:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:26,129 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:41:26,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:41:26,130 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-21 17:41:26,131 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-21 17:41:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:26,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:41:26,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:26,567 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-21 17:41:26,855 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-21 17:41:27,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:27,165 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-21 17:41:27,203 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-21 17:41:27,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2022-07-21 17:41:27,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 29 treesize of output 17 [2022-07-21 17:41:27,377 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-21 17:41:27,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:27,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1006691715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:27,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:27,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-21 17:41:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646209803] [2022-07-21 17:41:27,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:27,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 17:41:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 17:41:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=552, Unknown=5, NotChecked=0, Total=650 [2022-07-21 17:41:27,560 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 24 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:41:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:28,676 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-21 17:41:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:41:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-07-21 17:41:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:28,677 INFO L225 Difference]: With dead ends: 111 [2022-07-21 17:41:28,677 INFO L226 Difference]: Without dead ends: 111 [2022-07-21 17:41:28,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=153, Invalid=894, Unknown=9, NotChecked=0, Total=1056 [2022-07-21 17:41:28,678 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:28,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 626 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 0 Unknown, 224 Unchecked, 0.8s Time] [2022-07-21 17:41:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-21 17:41:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-21 17:41:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.48) internal successors, (111), 105 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2022-07-21 17:41:28,681 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 46 [2022-07-21 17:41:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:28,681 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2022-07-21 17:41:28,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:41:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-07-21 17:41:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:41:28,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:28,681 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-21 17:41:28,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:28,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-21 17:41:29,092 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-21 17:41:29,093 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2022-07-21 17:41:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:29,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956607021] [2022-07-21 17:41:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:29,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:29,095 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-21 17:41:29,096 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-21 17:41:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:29,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 17:41:29,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:29,470 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-21 17:41:29,478 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-21 17:41:29,712 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-21 17:41:29,839 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-21 17:41:29,845 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-21 17:41:30,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:30,261 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-21 17:41:30,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:30,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-21 17:41:30,288 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:41:30,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-21 17:41:30,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:30,302 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-21 17:41:30,424 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-21 17:41:30,430 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-21 17:41:30,487 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-21 17:41:30,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:31,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:31,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956607021] [2022-07-21 17:41:31,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956607021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1152410180] [2022-07-21 17:41:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:31,072 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:41:31,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:41:31,082 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-21 17:41:31,082 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-21 17:41:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:31,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:41:31,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:31,701 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-21 17:41:31,710 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-21 17:41:32,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-21 17:41:32,430 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-21 17:41:32,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:32,733 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-21 17:41:32,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:32,758 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-21 17:41:32,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:32,766 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-21 17:41:32,780 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:41:32,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-21 17:41:32,954 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-21 17:41:32,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:41:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:41:32,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:33,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1152410180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:33,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:33,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2022-07-21 17:41:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771181544] [2022-07-21 17:41:33,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:33,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 17:41:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 17:41:33,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=803, Unknown=15, NotChecked=0, Total=930 [2022-07-21 17:41:33,325 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:41:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:34,609 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-07-21 17:41:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:41:34,610 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-07-21 17:41:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:34,610 INFO L225 Difference]: With dead ends: 110 [2022-07-21 17:41:34,610 INFO L226 Difference]: Without dead ends: 110 [2022-07-21 17:41:34,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=1280, Unknown=19, NotChecked=0, Total=1482 [2022-07-21 17:41:34,611 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 21 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:34,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 839 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 637 Invalid, 0 Unknown, 204 Unchecked, 0.9s Time] [2022-07-21 17:41:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-21 17:41:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-21 17:41:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-07-21 17:41:34,613 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 46 [2022-07-21 17:41:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:34,614 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-07-21 17:41:34,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:41:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-07-21 17:41:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:41:34,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:34,614 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] [2022-07-21 17:41:34,636 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-21 17:41:34,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-21 17:41:35,015 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-21 17:41:35,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:35,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869774, now seen corresponding path program 1 times [2022-07-21 17:41:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:35,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123369231] [2022-07-21 17:41:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:35,037 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-21 17:41:35,038 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-21 17:41:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:35,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 17:41:35,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:35,453 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-21 17:41:35,680 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-21 17:41:35,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:35,817 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-21 17:41:35,824 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:41:35,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 17:41:35,831 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-21 17:41:36,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:36,135 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:41:36,136 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-21 17:41:36,189 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-21 17:41:36,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 67 [2022-07-21 17:41:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:36,199 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-21 17:41:36,357 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-21 17:41:36,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:36,455 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 60 treesize of output 43 [2022-07-21 17:41:36,585 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-21 17:41:36,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:36,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:36,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123369231] [2022-07-21 17:41:36,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123369231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:36,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221986627] [2022-07-21 17:41:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:36,901 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:41:36,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:41:36,902 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:41:36,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-07-21 17:41:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:37,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-21 17:41:37,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:37,559 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-21 17:41:38,016 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-21 17:41:38,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:38,285 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-21 17:41:38,290 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-21 17:41:38,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:38,590 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-21 17:41:38,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:38,612 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:41:38,612 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-21 17:41:38,656 INFO L356 Elim1Store]: treesize reduction 86, result has 36.3 percent of original size [2022-07-21 17:41:38,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 67 [2022-07-21 17:41:38,877 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-21 17:41:39,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:39,031 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 60 treesize of output 31 [2022-07-21 17:41:39,301 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-21 17:41:39,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:39,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [221986627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:39,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:39,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 35 [2022-07-21 17:41:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769281754] [2022-07-21 17:41:39,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:39,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 17:41:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 17:41:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1477, Unknown=5, NotChecked=0, Total=1640 [2022-07-21 17:41:39,498 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 36 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:41:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:41,032 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-21 17:41:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:41:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-07-21 17:41:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:41,033 INFO L225 Difference]: With dead ends: 109 [2022-07-21 17:41:41,033 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 17:41:41,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=257, Invalid=2284, Unknown=9, NotChecked=0, Total=2550 [2022-07-21 17:41:41,034 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 23 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:41,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1009 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 587 Invalid, 0 Unknown, 360 Unchecked, 1.0s Time] [2022-07-21 17:41:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 17:41:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-21 17:41:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 103 states have internal predecessors, (109), 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-21 17:41:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2022-07-21 17:41:41,037 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 48 [2022-07-21 17:41:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:41,037 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2022-07-21 17:41:41,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:41:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-07-21 17:41:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:41:41,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:41,038 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] [2022-07-21 17:41:41,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:41,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:41,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:41:41,447 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869775, now seen corresponding path program 1 times [2022-07-21 17:41:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:41,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132340694] [2022-07-21 17:41:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:41,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:41,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:41,449 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-21 17:41:41,451 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-21 17:41:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:41,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-21 17:41:41,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:41,799 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-21 17:41:41,805 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-21 17:41:42,153 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:41:42,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-21 17:41:42,166 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-21 17:41:42,537 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-21 17:41:42,549 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-21 17:41:42,772 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-21 17:41:42,772 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 68 treesize of output 44 [2022-07-21 17:41:42,782 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:41:42,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:41:42,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 17:41:42,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:41:43,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:43,254 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:41:43,255 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-21 17:41:43,284 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 17:41:43,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-21 17:41:43,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:41:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:43,316 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:41:43,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:41:43,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:41:43,595 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-21 17:41:43,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 56 [2022-07-21 17:41:43,620 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-21 17:41:43,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-21 17:41:43,729 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-21 17:41:43,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:44,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132340694] [2022-07-21 17:41:44,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132340694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1182476119] [2022-07-21 17:41:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:41:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:41:44,665 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-21 17:41:44,669 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-21 17:41:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:45,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-21 17:41:45,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:45,258 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-21 17:41:45,262 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-21 17:41:45,649 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:41:45,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-21 17:41:45,670 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-21 17:41:46,673 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-21 17:41:46,690 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-21 17:41:47,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:47,199 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-21 17:41:47,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:47,208 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-21 17:41:47,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:47,621 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-21 17:41:47,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:47,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:47,639 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:41:47,640 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-21 17:41:47,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:47,666 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:41:47,667 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-21 17:41:47,695 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 17:41:47,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-21 17:41:48,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:48,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:41:48,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:41:48,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 47 [2022-07-21 17:41:48,092 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-21 17:41:48,092 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-21 17:41:48,108 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-21 17:41:48,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:48,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1182476119] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:48,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:48,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2022-07-21 17:41:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410135962] [2022-07-21 17:41:48,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-21 17:41:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-21 17:41:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1701, Unknown=17, NotChecked=0, Total=1892 [2022-07-21 17:41:48,686 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 38 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:41:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:50,548 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-07-21 17:41:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:41:50,548 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-07-21 17:41:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:50,549 INFO L225 Difference]: With dead ends: 164 [2022-07-21 17:41:50,549 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 17:41:50,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=257, Invalid=2374, Unknown=21, NotChecked=0, Total=2652 [2022-07-21 17:41:50,550 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 103 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:50,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 847 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 527 Invalid, 0 Unknown, 269 Unchecked, 0.8s Time] [2022-07-21 17:41:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 17:41:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 108. [2022-07-21 17:41:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 75 states have (on average 1.44) internal successors, (108), 102 states have internal predecessors, (108), 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-21 17:41:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2022-07-21 17:41:50,552 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 48 [2022-07-21 17:41:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:50,552 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2022-07-21 17:41:50,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:41:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2022-07-21 17:41:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:41:50,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:50,553 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-21 17:41:50,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-21 17:41:50,761 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-21 17:41:50,954 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-21 17:41:50,955 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash -645963400, now seen corresponding path program 1 times [2022-07-21 17:41:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:50,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592760461] [2022-07-21 17:41:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:50,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:50,956 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-21 17:41:50,958 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-21 17:41:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:51,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:41:51,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:51,233 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-21 17:41:51,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:51,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:51,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592760461] [2022-07-21 17:41:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592760461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:51,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:51,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:41:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43186565] [2022-07-21 17:41:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:51,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:41:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:41:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:41:51,235 INFO L87 Difference]: Start difference. First operand 108 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-21 17:41:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:51,426 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2022-07-21 17:41:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:41:51,427 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-21 17:41:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:51,428 INFO L225 Difference]: With dead ends: 123 [2022-07-21 17:41:51,428 INFO L226 Difference]: Without dead ends: 123 [2022-07-21 17:41:51,428 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-21 17:41:51,428 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 156 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:51,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 118 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:41:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-21 17:41:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-21 17:41:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4) internal successors, (105), 99 states have internal predecessors, (105), 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-21 17:41:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-21 17:41:51,431 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 49 [2022-07-21 17:41:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:51,432 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-21 17:41:51,432 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-21 17:41:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-21 17:41:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:41:51,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:51,432 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-21 17:41:51,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:51,641 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-21 17:41:51,641 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -645963399, now seen corresponding path program 1 times [2022-07-21 17:41:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:51,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437526503] [2022-07-21 17:41:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:51,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:51,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:51,643 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-21 17:41:51,645 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-21 17:41:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:51,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:41:51,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:52,103 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-21 17:41:52,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:52,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:52,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437526503] [2022-07-21 17:41:52,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437526503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:52,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:52,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:41:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495468004] [2022-07-21 17:41:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:52,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:41:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:41:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:41:52,105 INFO L87 Difference]: Start difference. First operand 105 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-21 17:41:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:52,262 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-21 17:41:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:41:52,263 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-21 17:41:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:52,263 INFO L225 Difference]: With dead ends: 102 [2022-07-21 17:41:52,263 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 17:41:52,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:41:52,264 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 209 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:52,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:41:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 17:41:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-21 17:41:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.36) internal successors, (102), 96 states have internal predecessors, (102), 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-21 17:41:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-21 17:41:52,267 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 49 [2022-07-21 17:41:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:52,267 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-21 17:41:52,268 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-21 17:41:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-21 17:41:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:41:52,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:52,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:41:52,279 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-21 17:41:52,477 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-21 17:41:52,477 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432508, now seen corresponding path program 1 times [2022-07-21 17:41:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:52,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273849484] [2022-07-21 17:41:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:52,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:52,479 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-21 17:41:52,481 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-21 17:41:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:52,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 17:41:52,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:52,739 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-21 17:41:52,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:41:52,823 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-21 17:41:52,839 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-21 17:41:52,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:52,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:52,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273849484] [2022-07-21 17:41:52,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273849484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:52,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:52,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:41:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730756189] [2022-07-21 17:41:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:52,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:41:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:52,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:41:52,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:41:52,841 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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-21 17:41:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:53,794 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2022-07-21 17:41:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:41:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 51 [2022-07-21 17:41:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:53,795 INFO L225 Difference]: With dead ends: 168 [2022-07-21 17:41:53,795 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:41:53,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:41:53,795 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 255 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:53,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 384 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 17:41:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:41:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 105. [2022-07-21 17:41:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 99 states have internal predecessors, (106), 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-21 17:41:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2022-07-21 17:41:53,798 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 51 [2022-07-21 17:41:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:53,798 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2022-07-21 17:41:53,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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-21 17:41:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-07-21 17:41:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:41:53,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:53,799 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-21 17:41:53,808 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-21 17:41:54,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:41:54,008 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432509, now seen corresponding path program 1 times [2022-07-21 17:41:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:54,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845379566] [2022-07-21 17:41:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:54,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:54,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:54,016 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:41:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-21 17:41:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:54,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 17:41:54,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:54,376 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-21 17:41:54,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:41:54,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:41:54,641 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-21 17:41:54,645 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-21 17:41:54,705 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-21 17:41:54,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:41:54,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845379566] [2022-07-21 17:41:54,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845379566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:41:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:41:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:41:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248057242] [2022-07-21 17:41:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:41:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:41:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:41:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:41:54,707 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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-21 17:41:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:55,613 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2022-07-21 17:41:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:41:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 51 [2022-07-21 17:41:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:55,615 INFO L225 Difference]: With dead ends: 154 [2022-07-21 17:41:55,615 INFO L226 Difference]: Without dead ends: 154 [2022-07-21 17:41:55,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:41:55,615 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 188 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:55,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 400 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:41:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-21 17:41:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 107. [2022-07-21 17:41:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 101 states have internal predecessors, (108), 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-21 17:41:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2022-07-21 17:41:55,618 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 51 [2022-07-21 17:41:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:55,618 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2022-07-21 17:41:55,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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-21 17:41:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2022-07-21 17:41:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 17:41:55,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:55,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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:41:55,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-21 17:41:55,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:41:55,828 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:41:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:41:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1604261226, now seen corresponding path program 1 times [2022-07-21 17:41:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:41:55,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945022939] [2022-07-21 17:41:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:55,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:41:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:41:55,830 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-21 17:41:55,831 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-21 17:41:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:56,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:41:56,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:56,548 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-21 17:41:56,634 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-21 17:41:56,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:41:56,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-21 17:41:57,073 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-21 17:41:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:41:57,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:57,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:41:57,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945022939] [2022-07-21 17:41:57,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945022939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:57,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [669616218] [2022-07-21 17:41:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:41:57,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:41:57,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:41:57,276 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-21 17:41:57,277 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-21 17:41:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:41:57,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:41:57,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:41:58,253 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-21 17:41:58,628 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:41:58,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 17:41:58,783 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-21 17:41:58,785 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-21 17:41:58,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:41:58,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [669616218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:41:58,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:41:58,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2022-07-21 17:41:58,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373492189] [2022-07-21 17:41:58,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:41:58,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 17:41:58,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:41:58,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 17:41:58,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1068, Unknown=34, NotChecked=0, Total=1260 [2022-07-21 17:41:58,918 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 33 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 28 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:41:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:41:59,985 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-07-21 17:41:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:41:59,985 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 28 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-07-21 17:41:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:41:59,986 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:41:59,986 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 17:41:59,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=258, Invalid=1674, Unknown=48, NotChecked=0, Total=1980 [2022-07-21 17:41:59,987 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:41:59,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1274 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 353 Invalid, 0 Unknown, 195 Unchecked, 0.6s Time] [2022-07-21 17:41:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 17:41:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2022-07-21 17:41:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:41:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-21 17:41:59,989 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 53 [2022-07-21 17:41:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:41:59,989 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-21 17:41:59,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 28 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 17:41:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-21 17:41:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:41:59,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:41:59,990 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] [2022-07-21 17:41:59,995 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-21 17:42:00,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-21 17:42:00,405 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-21 17:42:00,405 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-07-21 17:42:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:42:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -696733545, now seen corresponding path program 1 times [2022-07-21 17:42:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:42:00,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141385801] [2022-07-21 17:42:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:42:00,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:42:00,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:42:00,408 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-21 17:42:00,409 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-21 17:42:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:42:00,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-21 17:42:00,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:42:00,902 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-21 17:42:00,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:42:01,007 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:42:01,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-21 17:42:01,084 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-21 17:42:01,318 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-21 17:42:01,467 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-21 17:42:01,467 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 25 treesize of output 25 [2022-07-21 17:42:01,473 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-21 17:42:01,477 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-21 17:42:01,886 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 17:42:01,886 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 3 case distinctions, treesize of input 31 treesize of output 41 [2022-07-21 17:42:01,899 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-21 17:42:01,899 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 17 treesize of output 17 [2022-07-21 17:42:01,904 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 17 treesize of output 13 [2022-07-21 17:42:01,948 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:42:01,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-21 17:42:01,952 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-21 17:42:02,159 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-21 17:42:02,374 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 17:42:02,375 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2022-07-21 17:42:02,382 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 16 treesize of output 12 [2022-07-21 17:42:02,478 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 17:42:02,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2022-07-21 17:42:02,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-07-21 17:42:02,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:42:02,658 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:42:02,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2022-07-21 17:42:02,780 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-21 17:42:02,781 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 46 treesize of output 34 [2022-07-21 17:42:02,844 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-21 17:42:02,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:42:02,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_2982) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (_ bv1 1)))) is different from false [2022-07-21 17:42:03,165 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-07-21 17:42:03,165 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 31 treesize of output 30 [2022-07-21 17:42:03,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2982 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset|)) v_ArrVal_2980) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_2982) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) is different from false [2022-07-21 17:42:03,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2982 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) v_ArrVal_2980) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_2982) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) is different from false [2022-07-21 17:42:03,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2982 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) v_ArrVal_2980) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_2982) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) is different from false [2022-07-21 17:42:03,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:42:03,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141385801] [2022-07-21 17:42:03,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141385801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:42:03,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1822759096] [2022-07-21 17:42:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:42:03,439 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:42:03,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:42:03,441 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-21 17:42:03,442 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-21 17:42:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:42:03,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 17:42:03,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:42:04,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:42:04,688 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-21 17:42:04,946 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 13 treesize of output 3 [2022-07-21 17:42:05,284 INFO L356 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2022-07-21 17:42:05,285 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 56 [2022-07-21 17:42:06,014 INFO L356 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-07-21 17:42:06,015 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 6 case distinctions, treesize of input 58 treesize of output 99 [2022-07-21 17:42:06,020 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:42:06,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-21 17:42:06,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-07-21 17:42:06,438 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-21 17:42:06,439 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) 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-21 17:42:06,443 INFO L158 Benchmark]: Toolchain (without parser) took 86387.10ms. Allocated memory was 52.4MB in the beginning and 88.1MB in the end (delta: 35.7MB). Free memory was 28.5MB in the beginning and 23.5MB in the end (delta: 5.0MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-07-21 17:42:06,443 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:42:06,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.96ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 28.4MB in the beginning and 47.9MB in the end (delta: -19.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-07-21 17:42:06,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.79ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:42:06,444 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 43.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:42:06,444 INFO L158 Benchmark]: RCFGBuilder took 833.45ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 36.5MB in the end (delta: 6.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-21 17:42:06,444 INFO L158 Benchmark]: TraceAbstraction took 85005.13ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 23.5MB in the end (delta: 12.4MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2022-07-21 17:42:06,445 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.21ms. Allocated memory is still 52.4MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.96ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 28.4MB in the beginning and 47.9MB in the end (delta: -19.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.79ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 43.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 833.45ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 36.5MB in the end (delta: 6.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 85005.13ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 23.5MB in the end (delta: 12.4MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:42:06,483 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER