./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:22:42,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:22:42,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:22:42,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:22:42,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:22:42,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:22:42,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:22:42,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:22:42,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:22:42,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:22:42,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:22:42,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:22:42,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:22:42,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:22:42,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:22:42,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:22:42,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:22:42,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:22:42,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:22:42,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:22:42,489 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:22:42,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:22:42,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:22:42,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:22:42,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:22:42,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:22:42,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:22:42,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:22:42,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:22:42,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:22:42,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:22:42,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:22:42,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:22:42,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:22:42,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:22:42,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:22:42,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:22:42,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:22:42,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:22:42,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:22:42,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:22:42,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:22:42,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:22:42,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:22:42,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:22:42,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:22:42,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:22:42,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:22:42,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:22:42,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:22:42,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:22:42,531 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:22:42,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:22:42,532 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:22:42,533 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:22:42,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:22:42,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:22:42,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:22:42,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:22:42,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:22:42,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:22:42,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:22:42,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:22:42,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:22:42,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:22:42,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:22:42,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:22:42,535 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2022-07-14 06:22:42,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:22:42,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:22:42,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:22:42,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:22:42,709 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:22:42,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-07-14 06:22:42,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97460bd82/ee0c03987be4432e90bf9890aca69484/FLAG4e27d19f1 [2022-07-14 06:22:43,107 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:22:43,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-07-14 06:22:43,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97460bd82/ee0c03987be4432e90bf9890aca69484/FLAG4e27d19f1 [2022-07-14 06:22:43,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97460bd82/ee0c03987be4432e90bf9890aca69484 [2022-07-14 06:22:43,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:22:43,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:22:43,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:22:43,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:22:43,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:22:43,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff7299e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43, skipping insertion in model container [2022-07-14 06:22:43,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:22:43,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:22:43,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:22:43,693 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:22:43,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:22:43,753 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:22:43,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43 WrapperNode [2022-07-14 06:22:43,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:22:43,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:22:43,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:22:43,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:22:43,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,785 INFO L137 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 142 [2022-07-14 06:22:43,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:22:43,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:22:43,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:22:43,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:22:43,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:22:43,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:22:43,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:22:43,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:22:43,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (1/1) ... [2022-07-14 06:22:43,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:22:43,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:43,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:22:43,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:22:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:22:43,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:22:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:22:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:22:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:22:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:22:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:22:43,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:22:43,977 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:22:43,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:22:44,251 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:22:44,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:22:44,256 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:22:44,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:22:44 BoogieIcfgContainer [2022-07-14 06:22:44,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:22:44,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:22:44,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:22:44,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:22:44,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:22:43" (1/3) ... [2022-07-14 06:22:44,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bf9538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:22:44, skipping insertion in model container [2022-07-14 06:22:44,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:22:43" (2/3) ... [2022-07-14 06:22:44,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bf9538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:22:44, skipping insertion in model container [2022-07-14 06:22:44,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:22:44" (3/3) ... [2022-07-14 06:22:44,263 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2022-07-14 06:22:44,272 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:22:44,272 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-07-14 06:22:44,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:22:44,305 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@142862c1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@476b845d [2022-07-14 06:22:44,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-07-14 06:22:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:22:44,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:44,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:22:44,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:22:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029786225] [2022-07-14 06:22:44,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:44,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029786225] [2022-07-14 06:22:44,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029786225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:44,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:44,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:22:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69300561] [2022-07-14 06:22:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:44,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:22:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:22:44,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:44,487 INFO L87 Difference]: Start difference. First operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:44,626 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-07-14 06:22:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:22:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:44,633 INFO L225 Difference]: With dead ends: 156 [2022-07-14 06:22:44,633 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 06:22:44,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:44,637 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 104 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:44,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 122 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 06:22:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2022-07-14 06:22:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2022-07-14 06:22:44,661 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 3 [2022-07-14 06:22:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:44,662 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2022-07-14 06:22:44,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-07-14 06:22:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:22:44,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:44,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:22:44,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:22:44,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:22:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:44,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018298460] [2022-07-14 06:22:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:44,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018298460] [2022-07-14 06:22:44,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018298460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:44,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:44,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:22:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559038945] [2022-07-14 06:22:44,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:44,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:22:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:44,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:22:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:44,694 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:44,763 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-14 06:22:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:22:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:44,764 INFO L225 Difference]: With dead ends: 132 [2022-07-14 06:22:44,764 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:22:44,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:44,765 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:44,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:22:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-14 06:22:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-07-14 06:22:44,784 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 3 [2022-07-14 06:22:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:44,784 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-07-14 06:22:44,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-07-14 06:22:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:22:44,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:44,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:44,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:22:44,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2022-07-14 06:22:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:44,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611560046] [2022-07-14 06:22:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:44,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611560046] [2022-07-14 06:22:44,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611560046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:44,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:44,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301972606] [2022-07-14 06:22:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:44,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:44,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:44,830 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:44,952 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-07-14 06:22:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:22:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:44,953 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:22:44,953 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:22:44,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:44,954 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 174 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:44,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 96 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:22:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2022-07-14 06:22:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2022-07-14 06:22:44,959 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 7 [2022-07-14 06:22:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:44,959 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2022-07-14 06:22:44,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2022-07-14 06:22:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:22:44,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:44,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:44,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:22:44,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:44,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2022-07-14 06:22:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:44,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980411959] [2022-07-14 06:22:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980411959] [2022-07-14 06:22:45,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980411959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407173343] [2022-07-14 06:22:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:45,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:45,004 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,149 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2022-07-14 06:22:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:22:45,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:22:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,151 INFO L225 Difference]: With dead ends: 163 [2022-07-14 06:22:45,152 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 06:22:45,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:45,153 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 213 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 116 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 06:22:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2022-07-14 06:22:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2022-07-14 06:22:45,159 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 7 [2022-07-14 06:22:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,159 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2022-07-14 06:22:45,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2022-07-14 06:22:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:22:45,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:22:45,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash 59388299, now seen corresponding path program 1 times [2022-07-14 06:22:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047526189] [2022-07-14 06:22:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047526189] [2022-07-14 06:22:45,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047526189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:22:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712153469] [2022-07-14 06:22:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:22:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:22:45,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,206 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,257 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2022-07-14 06:22:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:22:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,259 INFO L225 Difference]: With dead ends: 152 [2022-07-14 06:22:45,259 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 06:22:45,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,260 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 180 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:22:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 06:22:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-07-14 06:22:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2022-07-14 06:22:45,272 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 8 [2022-07-14 06:22:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,272 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2022-07-14 06:22:45,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2022-07-14 06:22:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:22:45,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:22:45,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 59388300, now seen corresponding path program 1 times [2022-07-14 06:22:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176709663] [2022-07-14 06:22:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,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-14 06:22:45,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176709663] [2022-07-14 06:22:45,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176709663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:22:45,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832001091] [2022-07-14 06:22:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:22:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:22:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,305 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,364 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-07-14 06:22:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:22:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,365 INFO L225 Difference]: With dead ends: 150 [2022-07-14 06:22:45,365 INFO L226 Difference]: Without dead ends: 150 [2022-07-14 06:22:45,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,366 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-14 06:22:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2022-07-14 06:22:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2022-07-14 06:22:45,378 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 8 [2022-07-14 06:22:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,378 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2022-07-14 06:22:45,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2022-07-14 06:22:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:22:45,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:22:45,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -387876619, now seen corresponding path program 1 times [2022-07-14 06:22:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093473222] [2022-07-14 06:22:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093473222] [2022-07-14 06:22:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093473222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013708913] [2022-07-14 06:22:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:22:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:22:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,441 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,454 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-07-14 06:22:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:45,454 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:22:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,455 INFO L225 Difference]: With dead ends: 147 [2022-07-14 06:22:45,455 INFO L226 Difference]: Without dead ends: 147 [2022-07-14 06:22:45,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,456 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:22:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-14 06:22:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-07-14 06:22:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2022-07-14 06:22:45,459 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 12 [2022-07-14 06:22:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,460 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2022-07-14 06:22:45,460 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2022-07-14 06:22:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:22:45,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:22:45,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash 860725951, now seen corresponding path program 1 times [2022-07-14 06:22:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340764035] [2022-07-14 06:22:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340764035] [2022-07-14 06:22:45,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340764035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123812739] [2022-07-14 06:22:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:45,503 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,595 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2022-07-14 06:22:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:45,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:22:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,596 INFO L225 Difference]: With dead ends: 159 [2022-07-14 06:22:45,596 INFO L226 Difference]: Without dead ends: 159 [2022-07-14 06:22:45,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:45,597 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 57 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 216 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-14 06:22:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2022-07-14 06:22:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-07-14 06:22:45,601 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 13 [2022-07-14 06:22:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,601 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-07-14 06:22:45,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-07-14 06:22:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:22:45,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:22:45,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 860725952, now seen corresponding path program 1 times [2022-07-14 06:22:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716593973] [2022-07-14 06:22:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716593973] [2022-07-14 06:22:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716593973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350780271] [2022-07-14 06:22:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:45,656 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,763 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2022-07-14 06:22:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:45,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:22:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,764 INFO L225 Difference]: With dead ends: 182 [2022-07-14 06:22:45,764 INFO L226 Difference]: Without dead ends: 182 [2022-07-14 06:22:45,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:45,765 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-14 06:22:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2022-07-14 06:22:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2022-07-14 06:22:45,768 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 13 [2022-07-14 06:22:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,768 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2022-07-14 06:22:45,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2022-07-14 06:22:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:22:45,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:22:45,769 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2022-07-14 06:22:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810539287] [2022-07-14 06:22:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810539287] [2022-07-14 06:22:45,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810539287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004243141] [2022-07-14 06:22:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:22:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:22:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,788 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,796 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2022-07-14 06:22:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:45,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:22:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,797 INFO L225 Difference]: With dead ends: 152 [2022-07-14 06:22:45,797 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 06:22:45,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:22:45,798 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:22:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 06:22:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-14 06:22:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2022-07-14 06:22:45,801 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 14 [2022-07-14 06:22:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,801 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2022-07-14 06:22:45,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2022-07-14 06:22:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:22:45,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:22:45,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash 932171324, now seen corresponding path program 1 times [2022-07-14 06:22:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020007260] [2022-07-14 06:22:45,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020007260] [2022-07-14 06:22:45,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020007260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474682976] [2022-07-14 06:22:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:45,837 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:45,886 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2022-07-14 06:22:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:22:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:22:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:45,887 INFO L225 Difference]: With dead ends: 166 [2022-07-14 06:22:45,888 INFO L226 Difference]: Without dead ends: 166 [2022-07-14 06:22:45,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:45,888 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:45,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 270 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:22:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-14 06:22:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2022-07-14 06:22:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2022-07-14 06:22:45,891 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 16 [2022-07-14 06:22:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:45,891 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2022-07-14 06:22:45,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2022-07-14 06:22:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:22:45,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:45,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:45,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:22:45,892 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2022-07-14 06:22:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:45,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894674553] [2022-07-14 06:22:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:45,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:45,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894674553] [2022-07-14 06:22:45,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894674553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:45,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:45,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:22:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71365087] [2022-07-14 06:22:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:45,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:22:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:45,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:22:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:45,938 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:46,065 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2022-07-14 06:22:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:22:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:22:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:46,066 INFO L225 Difference]: With dead ends: 189 [2022-07-14 06:22:46,066 INFO L226 Difference]: Without dead ends: 189 [2022-07-14 06:22:46,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:22:46,067 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 49 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:46,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 436 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-14 06:22:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2022-07-14 06:22:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2022-07-14 06:22:46,070 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 16 [2022-07-14 06:22:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:46,070 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2022-07-14 06:22:46,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2022-07-14 06:22:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:22:46,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:46,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:46,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:22:46,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516449, now seen corresponding path program 1 times [2022-07-14 06:22:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:46,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790578981] [2022-07-14 06:22:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:46,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:46,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790578981] [2022-07-14 06:22:46,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790578981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:46,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:46,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:22:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667997234] [2022-07-14 06:22:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:46,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:22:46,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:22:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:22:46,204 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:46,519 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2022-07-14 06:22:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:22:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:22:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:46,520 INFO L225 Difference]: With dead ends: 188 [2022-07-14 06:22:46,520 INFO L226 Difference]: Without dead ends: 188 [2022-07-14 06:22:46,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:22:46,521 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 186 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:46,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 316 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-14 06:22:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-07-14 06:22:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2022-07-14 06:22:46,524 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 18 [2022-07-14 06:22:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:46,524 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2022-07-14 06:22:46,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2022-07-14 06:22:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:22:46,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:46,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:46,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:22:46,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516448, now seen corresponding path program 1 times [2022-07-14 06:22:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:46,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693898299] [2022-07-14 06:22:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:46,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:46,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693898299] [2022-07-14 06:22:46,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693898299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:46,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:46,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:22:46,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945774761] [2022-07-14 06:22:46,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:46,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:22:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:46,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:22:46,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:22:46,670 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:47,146 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2022-07-14 06:22:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:22:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:22:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:47,147 INFO L225 Difference]: With dead ends: 230 [2022-07-14 06:22:47,147 INFO L226 Difference]: Without dead ends: 230 [2022-07-14 06:22:47,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:22:47,148 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 423 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:47,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 324 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:22:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-14 06:22:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2022-07-14 06:22:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2022-07-14 06:22:47,151 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 18 [2022-07-14 06:22:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:47,151 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2022-07-14 06:22:47,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2022-07-14 06:22:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:22:47,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:47,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:47,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:22:47,151 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2022-07-14 06:22:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:47,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118891226] [2022-07-14 06:22:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:47,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118891226] [2022-07-14 06:22:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118891226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:47,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095438765] [2022-07-14 06:22:47,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:47,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:47,178 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:47,273 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2022-07-14 06:22:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:22:47,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:22:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:47,274 INFO L225 Difference]: With dead ends: 186 [2022-07-14 06:22:47,274 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 06:22:47,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:47,275 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:47,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 06:22:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-14 06:22:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2022-07-14 06:22:47,278 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 18 [2022-07-14 06:22:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:47,278 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2022-07-14 06:22:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2022-07-14 06:22:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:22:47,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:47,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:22:47,279 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2022-07-14 06:22:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:47,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141987521] [2022-07-14 06:22:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:47,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141987521] [2022-07-14 06:22:47,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141987521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:47,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:47,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66901861] [2022-07-14 06:22:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:47,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:47,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:47,315 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:47,433 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2022-07-14 06:22:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:22:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:22:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:47,435 INFO L225 Difference]: With dead ends: 185 [2022-07-14 06:22:47,435 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 06:22:47,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:47,435 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:47,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 06:22:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-14 06:22:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2022-07-14 06:22:47,439 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 18 [2022-07-14 06:22:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:47,440 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2022-07-14 06:22:47,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2022-07-14 06:22:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:22:47,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:47,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:47,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:22:47,441 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2022-07-14 06:22:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:47,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614304640] [2022-07-14 06:22:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:47,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614304640] [2022-07-14 06:22:47,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614304640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:47,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:47,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623016912] [2022-07-14 06:22:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:47,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:22:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:22:47,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:22:47,499 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:47,704 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-07-14 06:22:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:22:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:47,706 INFO L225 Difference]: With dead ends: 187 [2022-07-14 06:22:47,706 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 06:22:47,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:22:47,707 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 75 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:47,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 254 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 06:22:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-07-14 06:22:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2022-07-14 06:22:47,710 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 21 [2022-07-14 06:22:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:47,710 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2022-07-14 06:22:47,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2022-07-14 06:22:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:22:47,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:47,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:47,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:22:47,712 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2022-07-14 06:22:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:47,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067325615] [2022-07-14 06:22:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067325615] [2022-07-14 06:22:47,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067325615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:47,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:47,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399808459] [2022-07-14 06:22:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:47,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:22:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:22:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:22:47,799 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:47,999 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-07-14 06:22:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:48,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:22:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:48,000 INFO L225 Difference]: With dead ends: 186 [2022-07-14 06:22:48,001 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 06:22:48,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:22:48,001 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 76 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:48,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 254 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 06:22:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-07-14 06:22:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2022-07-14 06:22:48,004 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 21 [2022-07-14 06:22:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:48,004 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2022-07-14 06:22:48,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2022-07-14 06:22:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:22:48,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:48,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:48,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:22:48,006 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2022-07-14 06:22:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:48,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156933340] [2022-07-14 06:22:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:48,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156933340] [2022-07-14 06:22:48,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156933340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:48,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:48,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:48,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959542282] [2022-07-14 06:22:48,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:48,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:48,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:48,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:48,031 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:48,129 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-07-14 06:22:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:22:48,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:22:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:48,130 INFO L225 Difference]: With dead ends: 182 [2022-07-14 06:22:48,130 INFO L226 Difference]: Without dead ends: 182 [2022-07-14 06:22:48,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:48,131 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:48,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-14 06:22:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-07-14 06:22:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2022-07-14 06:22:48,134 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 22 [2022-07-14 06:22:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:48,134 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2022-07-14 06:22:48,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2022-07-14 06:22:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:22:48,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:48,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:48,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:22:48,135 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2022-07-14 06:22:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:48,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092099683] [2022-07-14 06:22:48,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:48,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092099683] [2022-07-14 06:22:48,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092099683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:48,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:48,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032063053] [2022-07-14 06:22:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:48,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:48,191 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:48,299 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2022-07-14 06:22:48,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:22:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:22:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:48,300 INFO L225 Difference]: With dead ends: 181 [2022-07-14 06:22:48,300 INFO L226 Difference]: Without dead ends: 181 [2022-07-14 06:22:48,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:48,300 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:48,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-14 06:22:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-14 06:22:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2022-07-14 06:22:48,303 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 22 [2022-07-14 06:22:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:48,304 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2022-07-14 06:22:48,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-07-14 06:22:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:22:48,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:48,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:48,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:22:48,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -496178395, now seen corresponding path program 1 times [2022-07-14 06:22:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:48,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604827688] [2022-07-14 06:22:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604827688] [2022-07-14 06:22:48,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604827688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:48,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:48,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:22:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407250844] [2022-07-14 06:22:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:48,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:22:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:22:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:22:48,390 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:48,625 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-07-14 06:22:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:22:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:22:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:48,626 INFO L225 Difference]: With dead ends: 199 [2022-07-14 06:22:48,626 INFO L226 Difference]: Without dead ends: 199 [2022-07-14 06:22:48,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:22:48,627 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 273 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:48,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 433 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-14 06:22:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 183. [2022-07-14 06:22:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-07-14 06:22:48,630 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-07-14 06:22:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:48,630 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-07-14 06:22:48,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-07-14 06:22:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:22:48,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:48,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:48,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:22:48,630 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2022-07-14 06:22:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:48,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520747820] [2022-07-14 06:22:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520747820] [2022-07-14 06:22:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520747820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:48,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:48,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278685314] [2022-07-14 06:22:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:22:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:22:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:22:48,686 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:48,858 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-07-14 06:22:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:22:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:48,859 INFO L225 Difference]: With dead ends: 185 [2022-07-14 06:22:48,859 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 06:22:48,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:22:48,860 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:48,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 244 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 06:22:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-07-14 06:22:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2022-07-14 06:22:48,863 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 25 [2022-07-14 06:22:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:48,863 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2022-07-14 06:22:48,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2022-07-14 06:22:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:22:48,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:48,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:48,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:22:48,864 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2022-07-14 06:22:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811763998] [2022-07-14 06:22:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:48,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:48,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811763998] [2022-07-14 06:22:48,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811763998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:48,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:48,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692976856] [2022-07-14 06:22:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:22:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:22:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:22:48,943 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:49,153 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-07-14 06:22:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:49,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:22:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:49,155 INFO L225 Difference]: With dead ends: 184 [2022-07-14 06:22:49,155 INFO L226 Difference]: Without dead ends: 184 [2022-07-14 06:22:49,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:22:49,155 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:49,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 292 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-14 06:22:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-07-14 06:22:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2022-07-14 06:22:49,158 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 25 [2022-07-14 06:22:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:49,158 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2022-07-14 06:22:49,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-07-14 06:22:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:22:49,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:49,159 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:49,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:22:49,159 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1627096903, now seen corresponding path program 1 times [2022-07-14 06:22:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:49,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480125028] [2022-07-14 06:22:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:49,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480125028] [2022-07-14 06:22:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480125028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:22:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264357460] [2022-07-14 06:22:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:49,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:49,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:22:49,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:22:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:49,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:22:49,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:49,382 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-14 06:22:49,386 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-14 06:22:49,427 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:49,427 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 21 treesize of output 20 [2022-07-14 06:22:49,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:49,431 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 21 treesize of output 20 [2022-07-14 06:22:49,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:49,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:49,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264357460] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:49,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:22:49,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-14 06:22:49,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024859280] [2022-07-14 06:22:49,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:49,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:49,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:49,510 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:49,558 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2022-07-14 06:22:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:22:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:49,559 INFO L225 Difference]: With dead ends: 187 [2022-07-14 06:22:49,559 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 06:22:49,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:49,560 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:49,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 354 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:22:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 06:22:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2022-07-14 06:22:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-07-14 06:22:49,562 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 26 [2022-07-14 06:22:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:49,563 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-07-14 06:22:49,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-07-14 06:22:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:22:49,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:49,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:49,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:49,779 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,SelfDestructingSolverStorable23 [2022-07-14 06:22:49,779 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1099603412, now seen corresponding path program 1 times [2022-07-14 06:22:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:49,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842319753] [2022-07-14 06:22:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842319753] [2022-07-14 06:22:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842319753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:22:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071841545] [2022-07-14 06:22:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:49,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:49,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:22:49,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:22:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:50,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:22:50,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:50,173 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-14 06:22:50,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:50,254 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2022-07-14 06:22:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:50,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:50,711 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 41 treesize of output 37 [2022-07-14 06:22:50,715 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 76 treesize of output 72 [2022-07-14 06:22:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:51,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071841545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:51,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:22:51,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2022-07-14 06:22:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544825706] [2022-07-14 06:22:51,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:51,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:22:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:22:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:22:51,071 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:51,699 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2022-07-14 06:22:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:22:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:22:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:51,701 INFO L225 Difference]: With dead ends: 207 [2022-07-14 06:22:51,701 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 06:22:51,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1581, Unknown=0, NotChecked=0, Total=1806 [2022-07-14 06:22:51,702 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 165 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:51,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 891 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 580 Invalid, 0 Unknown, 354 Unchecked, 0.3s Time] [2022-07-14 06:22:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 06:22:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-07-14 06:22:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2022-07-14 06:22:51,704 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 27 [2022-07-14 06:22:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:51,705 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2022-07-14 06:22:51,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2022-07-14 06:22:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:22:51,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:51,705 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:51,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:51,905 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,SelfDestructingSolverStorable24 [2022-07-14 06:22:51,906 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash -466107059, now seen corresponding path program 1 times [2022-07-14 06:22:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697243584] [2022-07-14 06:22:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:51,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:51,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697243584] [2022-07-14 06:22:51,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697243584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:51,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:51,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:22:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217561010] [2022-07-14 06:22:51,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:51,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:22:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:22:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:51,960 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:52,134 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2022-07-14 06:22:52,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 06:22:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:52,136 INFO L225 Difference]: With dead ends: 216 [2022-07-14 06:22:52,136 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 06:22:52,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:22:52,137 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 125 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:52,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 189 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 06:22:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2022-07-14 06:22:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 197 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2022-07-14 06:22:52,141 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 30 [2022-07-14 06:22:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:52,141 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2022-07-14 06:22:52,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2022-07-14 06:22:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:22:52,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:52,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:52,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 06:22:52,142 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1564416794, now seen corresponding path program 1 times [2022-07-14 06:22:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:52,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214513623] [2022-07-14 06:22:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:52,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214513623] [2022-07-14 06:22:52,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214513623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:52,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467283263] [2022-07-14 06:22:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:52,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:52,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:52,169 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:52,199 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2022-07-14 06:22:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:52,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 06:22:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:52,200 INFO L225 Difference]: With dead ends: 227 [2022-07-14 06:22:52,200 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 06:22:52,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:52,201 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:52,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 270 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:22:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 06:22:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 198. [2022-07-14 06:22:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 197 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 228 transitions. [2022-07-14 06:22:52,204 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 228 transitions. Word has length 31 [2022-07-14 06:22:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:52,204 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 228 transitions. [2022-07-14 06:22:52,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 228 transitions. [2022-07-14 06:22:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:22:52,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:52,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:52,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:22:52,205 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 821443088, now seen corresponding path program 1 times [2022-07-14 06:22:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:52,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431405676] [2022-07-14 06:22:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:52,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431405676] [2022-07-14 06:22:52,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431405676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:52,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:52,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:22:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259505397] [2022-07-14 06:22:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:52,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:22:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:22:52,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:22:52,408 INFO L87 Difference]: Start difference. First operand 198 states and 228 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:52,976 INFO L93 Difference]: Finished difference Result 226 states and 259 transitions. [2022-07-14 06:22:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:22:52,977 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-14 06:22:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:52,978 INFO L225 Difference]: With dead ends: 226 [2022-07-14 06:22:52,978 INFO L226 Difference]: Without dead ends: 219 [2022-07-14 06:22:52,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:22:52,978 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 213 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:52,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 552 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:22:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-14 06:22:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 196. [2022-07-14 06:22:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 169 states have (on average 1.331360946745562) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2022-07-14 06:22:52,981 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 37 [2022-07-14 06:22:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:52,981 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2022-07-14 06:22:52,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2022-07-14 06:22:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:22:52,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:52,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 06:22:52,982 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash 431036240, now seen corresponding path program 1 times [2022-07-14 06:22:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:52,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96506092] [2022-07-14 06:22:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:53,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:53,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96506092] [2022-07-14 06:22:53,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96506092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:53,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:53,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:22:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796303020] [2022-07-14 06:22:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:22:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:53,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:22:53,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:22:53,169 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:53,622 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2022-07-14 06:22:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:22:53,622 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-14 06:22:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:53,623 INFO L225 Difference]: With dead ends: 222 [2022-07-14 06:22:53,623 INFO L226 Difference]: Without dead ends: 197 [2022-07-14 06:22:53,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:22:53,624 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 182 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:53,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 574 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:22:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-14 06:22:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2022-07-14 06:22:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3525641025641026) internal successors, (211), 182 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2022-07-14 06:22:53,626 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 37 [2022-07-14 06:22:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:53,627 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2022-07-14 06:22:53,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2022-07-14 06:22:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:22:53,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:53,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:53,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:22:53,627 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2022-07-14 06:22:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:53,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900925002] [2022-07-14 06:22:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:53,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900925002] [2022-07-14 06:22:53,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900925002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:22:53,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129947946] [2022-07-14 06:22:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:53,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:53,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:53,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:22:53,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:22:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:53,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:22:53,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:54,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:54,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:54,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:54,287 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-14 06:22:54,287 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 06:22:54,294 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-14 06:22:54,295 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:22:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:54,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129947946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:54,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:22:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 23 [2022-07-14 06:22:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248051089] [2022-07-14 06:22:54,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:22:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:22:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:22:54,497 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:54,941 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2022-07-14 06:22:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:22:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:22:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:54,942 INFO L225 Difference]: With dead ends: 223 [2022-07-14 06:22:54,942 INFO L226 Difference]: Without dead ends: 223 [2022-07-14 06:22:54,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 06:22:54,943 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 409 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:54,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 872 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 447 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2022-07-14 06:22:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-14 06:22:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2022-07-14 06:22:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 180 states have (on average 1.3277777777777777) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2022-07-14 06:22:54,946 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 38 [2022-07-14 06:22:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:54,946 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2022-07-14 06:22:54,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2022-07-14 06:22:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:22:54,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:54,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:54,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:55,152 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2022-07-14 06:22:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912406887] [2022-07-14 06:22:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912406887] [2022-07-14 06:22:55,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912406887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:22:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528672953] [2022-07-14 06:22:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:55,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:22:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:22:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:55,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 06:22:55,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:55,644 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:55,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:22:55,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:55,689 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 21 treesize of output 20 [2022-07-14 06:22:55,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:55,696 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 21 treesize of output 20 [2022-07-14 06:22:55,762 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:55,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-14 06:22:55,765 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 20 treesize of output 22 [2022-07-14 06:22:55,817 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:55,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-14 06:22:55,821 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 20 treesize of output 22 [2022-07-14 06:22:55,879 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-14 06:22:55,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:22:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:55,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:55,907 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_946 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:22:55,913 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_946 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:22:55,924 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_944))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_947)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_945) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:22:55,931 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_945) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_946))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_944))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_947))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:22:55,944 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_943 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_943)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_945) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_946)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_944))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_947))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2022-07-14 06:22:56,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:56,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:56,246 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2022-07-14 06:22:56,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:56,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:56,254 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 90 [2022-07-14 06:22:56,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:56,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:56,278 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-07-14 06:22:56,278 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 175 [2022-07-14 06:22:56,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:56,295 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 06:22:56,296 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 214 treesize of output 213 [2022-07-14 06:22:56,304 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:22:56,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:22:56,319 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 48 treesize of output 44 [2022-07-14 06:22:56,334 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 48 treesize of output 42 [2022-07-14 06:22:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:56,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528672953] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:56,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:22:56,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2022-07-14 06:22:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75876695] [2022-07-14 06:22:56,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:22:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:22:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:22:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=673, Unknown=7, NotChecked=290, Total=1122 [2022-07-14 06:22:56,374 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:57,574 INFO L93 Difference]: Finished difference Result 516 states and 608 transitions. [2022-07-14 06:22:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 06:22:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:22:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:57,576 INFO L225 Difference]: With dead ends: 516 [2022-07-14 06:22:57,576 INFO L226 Difference]: Without dead ends: 516 [2022-07-14 06:22:57,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=542, Invalid=1920, Unknown=8, NotChecked=500, Total=2970 [2022-07-14 06:22:57,577 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 490 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1131 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:57,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1209 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1034 Invalid, 0 Unknown, 1131 Unchecked, 0.5s Time] [2022-07-14 06:22:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-07-14 06:22:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 242. [2022-07-14 06:22:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3162790697674418) internal successors, (283), 241 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 283 transitions. [2022-07-14 06:22:57,581 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 283 transitions. Word has length 38 [2022-07-14 06:22:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:57,581 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 283 transitions. [2022-07-14 06:22:57,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 283 transitions. [2022-07-14 06:22:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:22:57,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:57,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:57,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:57,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:57,783 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:22:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2022-07-14 06:22:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:22:57,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100569307] [2022-07-14 06:22:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:22:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:22:57,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100569307] [2022-07-14 06:22:57,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100569307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:22:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878792375] [2022-07-14 06:22:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:22:57,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:22:57,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:22:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:22:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:58,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:22:58,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:58,180 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:22:58,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:22:58,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:22:58,269 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:58,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:22:58,313 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:58,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:22:58,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:58,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-14 06:22:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:58,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:58,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:58,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-14 06:22:58,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:58,689 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 255 [2022-07-14 06:22:58,694 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 236 treesize of output 220 [2022-07-14 06:22:58,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:58,702 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 220 treesize of output 200 [2022-07-14 06:23:23,551 INFO L356 Elim1Store]: treesize reduction 5, result has 98.3 percent of original size [2022-07-14 06:23:23,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 204 treesize of output 469 [2022-07-14 06:23:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:23:27,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878792375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:23:27,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:23:27,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 34 [2022-07-14 06:23:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907369310] [2022-07-14 06:23:27,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:23:27,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:23:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:23:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:23:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=956, Unknown=24, NotChecked=0, Total=1190 [2022-07-14 06:23:27,416 INFO L87 Difference]: Start difference. First operand 242 states and 283 transitions. Second operand has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:23:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:23:27,839 INFO L93 Difference]: Finished difference Result 452 states and 547 transitions. [2022-07-14 06:23:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:23:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-14 06:23:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:23:27,841 INFO L225 Difference]: With dead ends: 452 [2022-07-14 06:23:27,841 INFO L226 Difference]: Without dead ends: 452 [2022-07-14 06:23:27,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=1092, Unknown=24, NotChecked=0, Total=1406 [2022-07-14 06:23:27,842 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 207 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:23:27,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1375 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 735 Invalid, 0 Unknown, 777 Unchecked, 0.3s Time] [2022-07-14 06:23:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-14 06:23:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 373. [2022-07-14 06:23:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 346 states have (on average 1.3208092485549132) internal successors, (457), 372 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:23:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 457 transitions. [2022-07-14 06:23:27,847 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 457 transitions. Word has length 46 [2022-07-14 06:23:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:23:27,847 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 457 transitions. [2022-07-14 06:23:27,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:23:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 457 transitions. [2022-07-14 06:23:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:23:27,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:23:27,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:23:27,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:23:28,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:23:28,065 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:23:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:23:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2022-07-14 06:23:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:23:28,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451639365] [2022-07-14 06:23:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:23:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:23:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:23:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:23:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:23:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451639365] [2022-07-14 06:23:28,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451639365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:23:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997336492] [2022-07-14 06:23:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:23:28,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:23:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:23:28,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:23:28,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:23:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:23:28,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 06:23:28,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:23:28,487 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:23:28,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:23:28,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:23:28,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:23:28,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:23:28,599 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:23:28,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:23:28,613 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 22 treesize of output 24 [2022-07-14 06:23:28,659 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:23:28,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:23:28,662 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 18 treesize of output 20 [2022-07-14 06:23:28,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:23:28,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:23:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:23:28,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:23:28,864 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))))) (forall ((v_ArrVal_1177 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2022-07-14 06:23:28,873 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) (forall ((v_ArrVal_1177 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2022-07-14 06:23:28,883 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1175))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1174) .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))))) is different from false [2022-07-14 06:23:28,891 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1175))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1174) .cse1 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1175) |c_ULTIMATE.start_main_~n~0#1.base|) .cse6) v_ArrVal_1177))) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2022-07-14 06:23:28,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:28,902 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-14 06:23:28,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:28,905 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-14 06:23:28,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:28,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 349 [2022-07-14 06:23:28,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:28,930 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1148 treesize of output 1085 [2022-07-14 06:23:28,940 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 1066 treesize of output 986 [2022-07-14 06:23:28,945 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 986 treesize of output 906 [2022-07-14 06:23:28,951 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 906 treesize of output 874 [2022-07-14 06:23:28,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:28,962 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 874 treesize of output 734 [2022-07-14 06:23:30,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:30,641 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-14 06:23:30,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:30,647 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:23:30,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:23:30,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-14 06:23:30,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:23:30,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:23:30,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-14 06:23:30,824 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:23:30,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 13 treesize of output 12 [2022-07-14 06:23:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:23:30,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997336492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:23:30,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:23:30,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-14 06:23:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28282156] [2022-07-14 06:23:30,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:23:30,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:23:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:23:30,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:23:30,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=772, Unknown=4, NotChecked=244, Total=1190 [2022-07-14 06:23:30,878 INFO L87 Difference]: Start difference. First operand 373 states and 457 transitions. Second operand has 35 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 35 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:23:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:23:31,838 INFO L93 Difference]: Finished difference Result 692 states and 846 transitions. [2022-07-14 06:23:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:23:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 35 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-14 06:23:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:23:31,840 INFO L225 Difference]: With dead ends: 692 [2022-07-14 06:23:31,840 INFO L226 Difference]: Without dead ends: 692 [2022-07-14 06:23:31,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=428, Invalid=1564, Unknown=4, NotChecked=356, Total=2352 [2022-07-14 06:23:31,841 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 881 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:23:31,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1121 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1159 Invalid, 0 Unknown, 870 Unchecked, 0.5s Time] [2022-07-14 06:23:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-07-14 06:23:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 443. [2022-07-14 06:23:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.319047619047619) internal successors, (554), 442 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:23:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 554 transitions. [2022-07-14 06:23:31,847 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 554 transitions. Word has length 46 [2022-07-14 06:23:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:23:31,847 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 554 transitions. [2022-07-14 06:23:31,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 35 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:23:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 554 transitions. [2022-07-14 06:23:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:23:31,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:23:31,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:23:31,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:23:32,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:23:32,066 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:23:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:23:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -659497038, now seen corresponding path program 1 times [2022-07-14 06:23:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:23:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158271364] [2022-07-14 06:23:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:23:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:23:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:23:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:23:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:23:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158271364] [2022-07-14 06:23:32,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158271364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:23:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630669297] [2022-07-14 06:23:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:23:32,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:23:32,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:23:32,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:23:32,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:23:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:23:32,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-14 06:23:32,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:23:32,487 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:23:32,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:23:32,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 06:23:32,591 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:23:32,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-14 06:23:32,649 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:23:32,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-14 06:23:32,805 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-14 06:23:32,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-14 06:23:32,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:23:32,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2022-07-14 06:23:32,989 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:23:32,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2022-07-14 06:23:33,079 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:23:33,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2022-07-14 06:23:33,233 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 0 case distinctions, treesize of input 62 treesize of output 30 [2022-07-14 06:23:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:23:33,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:23:33,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1295) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-14 06:23:33,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1295) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-14 06:23:33,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1295)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-14 06:23:33,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1295))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2022-07-14 06:23:33,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_16| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_16|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_16| 1) (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_16| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1295))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1))) is different from false [2022-07-14 06:23:33,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:33,685 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 131 [2022-07-14 06:23:33,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:23:33,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:33,727 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 124790 treesize of output 123658 [2022-07-14 06:23:34,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:34,047 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 125948 treesize of output 124670 [2022-07-14 06:23:37,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:23:37,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:37,077 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 123412 treesize of output 115698 [2022-07-14 06:23:38,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114898 treesize of output 109266 [2022-07-14 06:23:38,655 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 109266 treesize of output 106450