./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.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 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:55:17,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:55:17,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:55:17,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:55:17,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:55:17,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:55:17,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:55:17,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:55:17,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:55:17,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:55:17,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:55:17,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:55:17,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:55:17,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:55:17,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:55:17,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:55:17,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:55:17,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:55:17,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:55:17,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:55:17,513 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:55:17,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:55:17,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:55:17,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:55:17,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:55:17,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:55:17,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:55:17,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:55:17,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:55:17,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:55:17,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:55:17,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:55:17,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:55:17,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:55:17,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:55:17,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:55:17,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:55:17,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:55:17,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:55:17,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:55:17,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:55:17,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:55:17,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 16:55:17,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:55:17,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:55:17,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:55:17,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:55:17,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:55:17,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:55:17,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:55:17,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:55:17,578 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:55:17,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:55:17,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:55:17,579 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:55:17,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:55:17,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:55:17,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:55:17,589 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:55:17,589 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:55:17,589 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 16:55:17,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:55:17,590 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:55:17,590 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:55:17,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:55:17,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:55:17,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:55:17,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:55:17,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:55:17,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:55:17,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:55:17,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:55:17,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:55:17,592 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2022-07-21 16:55:17,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:55:17,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:55:17,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:55:17,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:55:17,933 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:55:17,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-21 16:55:17,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ae07ee9/49471a244e084402a0c726ef56939020/FLAG013a13635 [2022-07-21 16:55:18,461 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:55:18,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-21 16:55:18,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ae07ee9/49471a244e084402a0c726ef56939020/FLAG013a13635 [2022-07-21 16:55:18,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ae07ee9/49471a244e084402a0c726ef56939020 [2022-07-21 16:55:18,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:55:18,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:55:18,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:55:18,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:55:18,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:55:18,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:55:18" (1/1) ... [2022-07-21 16:55:18,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1618d511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:18, skipping insertion in model container [2022-07-21 16:55:18,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:55:18" (1/1) ... [2022-07-21 16:55:18,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:55:18,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:55:19,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:55:19,142 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:55:19,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:55:19,226 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:55:19,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19 WrapperNode [2022-07-21 16:55:19,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:55:19,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:55:19,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:55:19,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:55:19,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,292 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-21 16:55:19,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:55:19,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:55:19,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:55:19,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:55:19,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:55:19,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:55:19,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:55:19,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:55:19,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (1/1) ... [2022-07-21 16:55:19,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:55:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:19,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 16:55:19,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 16:55:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 16:55:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 16:55:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 16:55:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 16:55:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 16:55:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:55:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:55:19,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:55:19,569 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:55:19,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:55:19,903 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:55:19,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:55:19,909 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 16:55:19,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:55:19 BoogieIcfgContainer [2022-07-21 16:55:19,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:55:19,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:55:19,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:55:19,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:55:19,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:55:18" (1/3) ... [2022-07-21 16:55:19,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a456b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:55:19, skipping insertion in model container [2022-07-21 16:55:19,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:19" (2/3) ... [2022-07-21 16:55:19,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a456b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:55:19, skipping insertion in model container [2022-07-21 16:55:19,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:55:19" (3/3) ... [2022-07-21 16:55:19,917 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2022-07-21 16:55:19,929 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:55:19,930 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-21 16:55:19,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:55:19,981 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@374bcafe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5683030e [2022-07-21 16:55:19,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-21 16:55:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 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-21 16:55:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:20,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:20,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:20,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-21 16:55:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:20,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559970361] [2022-07-21 16:55:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:20,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:20,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559970361] [2022-07-21 16:55:20,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559970361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:20,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:20,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051112807] [2022-07-21 16:55:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:20,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:55:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:20,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:55:20,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:55:20,297 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-21 16:55:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:20,479 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-07-21 16:55:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:55:20,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-21 16:55:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:20,489 INFO L225 Difference]: With dead ends: 111 [2022-07-21 16:55:20,489 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 16:55:20,491 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-21 16:55:20,495 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:20,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 16:55:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 55. [2022-07-21 16:55:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 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-21 16:55:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-21 16:55:20,538 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2022-07-21 16:55:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:20,538 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-21 16:55:20,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-21 16:55:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-21 16:55:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:20,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:20,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:20,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:55:20,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-21 16:55:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197094012] [2022-07-21 16:55:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:20,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197094012] [2022-07-21 16:55:20,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197094012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:20,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:20,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:55:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288080736] [2022-07-21 16:55:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:20,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:20,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:20,645 INFO L87 Difference]: Start difference. First operand 55 states and 61 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-21 16:55:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:20,710 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-07-21 16:55:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:20,711 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-21 16:55:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:20,712 INFO L225 Difference]: With dead ends: 54 [2022-07-21 16:55:20,712 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 16:55:20,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:20,714 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:20,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 16:55:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-21 16:55:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 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-21 16:55:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-21 16:55:20,719 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2022-07-21 16:55:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:20,719 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-21 16:55:20,719 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-21 16:55:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-21 16:55:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:20,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:20,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:20,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:55:20,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-21 16:55:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:20,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785960114] [2022-07-21 16:55:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:20,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785960114] [2022-07-21 16:55:20,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785960114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:20,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:20,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668080963] [2022-07-21 16:55:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:20,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:20,776 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-21 16:55:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:20,791 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-21 16:55:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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-21 16:55:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:20,793 INFO L225 Difference]: With dead ends: 101 [2022-07-21 16:55:20,793 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 16:55:20,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:20,795 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:20,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 16:55:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2022-07-21 16:55:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 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-21 16:55:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-07-21 16:55:20,802 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2022-07-21 16:55:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:20,802 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-07-21 16:55:20,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-21 16:55:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-07-21 16:55:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:20,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:20,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:20,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:55:20,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-21 16:55:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:20,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293593228] [2022-07-21 16:55:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:20,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293593228] [2022-07-21 16:55:20,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293593228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:20,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:20,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:55:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963007470] [2022-07-21 16:55:20,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:20,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:20,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:20,847 INFO L87 Difference]: Start difference. First operand 57 states and 64 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-21 16:55:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:20,950 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-07-21 16:55:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:20,951 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-21 16:55:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:20,952 INFO L225 Difference]: With dead ends: 105 [2022-07-21 16:55:20,952 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 16:55:20,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-21 16:55:20,954 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:20,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 69 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 16:55:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 59. [2022-07-21 16:55:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 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-21 16:55:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-07-21 16:55:20,959 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 7 [2022-07-21 16:55:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:20,960 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-07-21 16:55:20,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-21 16:55:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-07-21 16:55:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:55:20,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:20,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:20,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:55:20,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2022-07-21 16:55:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:20,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105851311] [2022-07-21 16:55:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:20,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105851311] [2022-07-21 16:55:20,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105851311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:20,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:20,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:55:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825359485] [2022-07-21 16:55:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:20,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:55:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:55:20,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:55:20,995 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 16:55:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:21,029 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-21 16:55:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:55:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-21 16:55:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:21,031 INFO L225 Difference]: With dead ends: 53 [2022-07-21 16:55:21,032 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 16:55:21,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:55:21,033 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:21,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 16:55:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-21 16:55:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 states have internal predecessors, (61), 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-21 16:55:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-07-21 16:55:21,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2022-07-21 16:55:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:21,038 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-07-21 16:55:21,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 16:55:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-07-21 16:55:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:55:21,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:21,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:21,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:55:21,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2022-07-21 16:55:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:21,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714600346] [2022-07-21 16:55:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:21,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714600346] [2022-07-21 16:55:21,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714600346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:21,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:21,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:55:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137467760] [2022-07-21 16:55:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:21,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:55:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:55:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:55:21,086 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 16:55:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:21,112 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-21 16:55:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:55:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-21 16:55:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:21,113 INFO L225 Difference]: With dead ends: 47 [2022-07-21 16:55:21,114 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 16:55:21,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:55:21,115 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:21,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 16:55:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-21 16:55:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 states have internal predecessors, (55), 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-21 16:55:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-21 16:55:21,119 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 9 [2022-07-21 16:55:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:21,119 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-21 16:55:21,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 16:55:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-21 16:55:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:55:21,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:21,120 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:21,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:55:21,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-21 16:55:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:21,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450788744] [2022-07-21 16:55:21,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:21,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:21,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450788744] [2022-07-21 16:55:21,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450788744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:21,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743486933] [2022-07-21 16:55:21,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:21,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:21,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 16:55:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:21,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 16:55:21,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:21,460 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:21,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:55:21,545 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-21 16:55:21,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:21,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743486933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:21,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:21,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-21 16:55:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736810827] [2022-07-21 16:55:21,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:21,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 16:55:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:21,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 16:55:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:55:21,709 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 16:55:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:21,857 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-07-21 16:55:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:55:21,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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 11 [2022-07-21 16:55:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:21,859 INFO L225 Difference]: With dead ends: 83 [2022-07-21 16:55:21,859 INFO L226 Difference]: Without dead ends: 83 [2022-07-21 16:55:21,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-21 16:55:21,860 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:21,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 128 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-21 16:55:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2022-07-21 16:55:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 states have internal predecessors, (51), 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-21 16:55:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-21 16:55:21,864 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 11 [2022-07-21 16:55:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:21,864 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-21 16:55:21,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 16:55:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-21 16:55:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:55:21,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:21,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:21,892 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-21 16:55:22,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:22,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2022-07-21 16:55:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:22,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737612029] [2022-07-21 16:55:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:22,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737612029] [2022-07-21 16:55:22,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737612029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:22,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:22,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:55:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522987241] [2022-07-21 16:55:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:22,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:55:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:55:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:55:22,171 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 16:55:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:22,222 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-07-21 16:55:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:55:22,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-07-21 16:55:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:22,224 INFO L225 Difference]: With dead ends: 94 [2022-07-21 16:55:22,224 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 16:55:22,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:22,225 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:22,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 183 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 16:55:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-07-21 16:55:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 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-21 16:55:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-21 16:55:22,229 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 15 [2022-07-21 16:55:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:22,229 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-21 16:55:22,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 16:55:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-21 16:55:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:55:22,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:22,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:22,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:55:22,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:22,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2022-07-21 16:55:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:22,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49600276] [2022-07-21 16:55:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:22,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49600276] [2022-07-21 16:55:22,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49600276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:22,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:22,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:55:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13041403] [2022-07-21 16:55:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:22,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:55:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:55:22,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:55:22,295 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:55:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:22,331 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-07-21 16:55:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:55:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-07-21 16:55:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:22,332 INFO L225 Difference]: With dead ends: 67 [2022-07-21 16:55:22,332 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 16:55:22,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:55:22,333 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:22,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 16:55:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-07-21 16:55:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 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-21 16:55:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-21 16:55:22,337 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2022-07-21 16:55:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:22,337 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-21 16:55:22,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:55:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-21 16:55:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:55:22,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:22,338 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-21 16:55:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 16:55:22,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2022-07-21 16:55:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:22,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985146555] [2022-07-21 16:55:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985146555] [2022-07-21 16:55:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985146555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:22,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:22,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:55:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632612789] [2022-07-21 16:55:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:55:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:55:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:55:22,422 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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-21 16:55:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:22,511 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-21 16:55:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:55:22,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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-21 16:55:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:22,512 INFO L225 Difference]: With dead ends: 43 [2022-07-21 16:55:22,512 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 16:55:22,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:55:22,513 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 131 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:22,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 73 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 16:55:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-21 16:55:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 states have internal predecessors, (49), 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-21 16:55:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-21 16:55:22,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2022-07-21 16:55:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:22,517 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-21 16:55:22,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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-21 16:55:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-21 16:55:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:55:22,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:22,518 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-21 16:55:22,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:55:22,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2022-07-21 16:55:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216371930] [2022-07-21 16:55:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:22,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:22,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216371930] [2022-07-21 16:55:22,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216371930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:22,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:22,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:55:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108718121] [2022-07-21 16:55:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:22,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:55:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:55:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:55:22,646 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-21 16:55:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:22,801 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-21 16:55:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:55:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-21 16:55:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:22,802 INFO L225 Difference]: With dead ends: 49 [2022-07-21 16:55:22,802 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 16:55:22,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-21 16:55:22,803 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 157 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:22,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 86 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 16:55:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-21 16:55:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 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-21 16:55:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-21 16:55:22,805 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-07-21 16:55:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:22,805 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-21 16:55:22,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-21 16:55:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-21 16:55:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 16:55:22,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:22,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 16:55:22,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2022-07-21 16:55:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733937149] [2022-07-21 16:55:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:22,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733937149] [2022-07-21 16:55:22,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733937149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:22,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:22,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:55:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108141306] [2022-07-21 16:55:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:22,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:55:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:55:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:55:22,938 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-21 16:55:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:23,085 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-21 16:55:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:55:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2022-07-21 16:55:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:23,086 INFO L225 Difference]: With dead ends: 48 [2022-07-21 16:55:23,086 INFO L226 Difference]: Without dead ends: 48 [2022-07-21 16:55:23,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-21 16:55:23,087 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:23,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-21 16:55:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-07-21 16:55:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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-21 16:55:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-21 16:55:23,089 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2022-07-21 16:55:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:23,089 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-21 16:55:23,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-21 16:55:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-21 16:55:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 16:55:23,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:23,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:23,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 16:55:23,090 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2022-07-21 16:55:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:23,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576389953] [2022-07-21 16:55:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:23,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576389953] [2022-07-21 16:55:23,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576389953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:23,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:23,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 16:55:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55558721] [2022-07-21 16:55:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:23,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 16:55:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 16:55:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:55:23,290 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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-21 16:55:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:23,841 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-21 16:55:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:55:23,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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 19 [2022-07-21 16:55:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:23,842 INFO L225 Difference]: With dead ends: 85 [2022-07-21 16:55:23,843 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 16:55:23,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2022-07-21 16:55:23,844 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 244 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:23,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 157 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 16:55:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-07-21 16:55:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 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-21 16:55:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-21 16:55:23,847 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 19 [2022-07-21 16:55:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:23,847 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-21 16:55:23,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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-21 16:55:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-21 16:55:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:55:23,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:23,848 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] [2022-07-21 16:55:23,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:55:23,849 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2022-07-21 16:55:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:23,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249967745] [2022-07-21 16:55:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:23,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249967745] [2022-07-21 16:55:23,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249967745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:23,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:23,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089616129] [2022-07-21 16:55:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:23,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:55:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:55:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:55:23,909 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 16:55:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:23,958 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-21 16:55:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:55:23,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-07-21 16:55:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:23,959 INFO L225 Difference]: With dead ends: 44 [2022-07-21 16:55:23,959 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 16:55:23,960 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-21 16:55:23,960 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:23,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 16:55:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-21 16:55:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 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-21 16:55:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-21 16:55:23,963 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2022-07-21 16:55:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:23,963 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-21 16:55:23,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 16:55:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-21 16:55:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:55:23,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:23,964 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] [2022-07-21 16:55:23,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:55:23,965 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807690, now seen corresponding path program 1 times [2022-07-21 16:55:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:23,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993451912] [2022-07-21 16:55:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993451912] [2022-07-21 16:55:24,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993451912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:55:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146213525] [2022-07-21 16:55:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:55:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:55:24,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:55:24,086 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:55:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,138 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-07-21 16:55:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:55:24,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-07-21 16:55:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,139 INFO L225 Difference]: With dead ends: 88 [2022-07-21 16:55:24,139 INFO L226 Difference]: Without dead ends: 88 [2022-07-21 16:55:24,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:55:24,140 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-21 16:55:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-07-21 16:55:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 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-21 16:55:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-21 16:55:24,142 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2022-07-21 16:55:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,143 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-21 16:55:24,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:55:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-21 16:55:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:55:24,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,144 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] [2022-07-21 16:55:24,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 16:55:24,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829822, now seen corresponding path program 1 times [2022-07-21 16:55:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581107247] [2022-07-21 16:55:24,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,250 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-21 16:55:24,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581107247] [2022-07-21 16:55:24,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581107247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:55:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574399043] [2022-07-21 16:55:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:55:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:55:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:55:24,252 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:55:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,310 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-21 16:55:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:55:24,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-07-21 16:55:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,311 INFO L225 Difference]: With dead ends: 75 [2022-07-21 16:55:24,311 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 16:55:24,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:55:24,312 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 16:55:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-07-21 16:55:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 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-21 16:55:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-07-21 16:55:24,315 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2022-07-21 16:55:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-07-21 16:55:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:55:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-07-21 16:55:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:55:24,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,317 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] [2022-07-21 16:55:24,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:55:24,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2022-07-21 16:55:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355616545] [2022-07-21 16:55:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355616545] [2022-07-21 16:55:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355616545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 16:55:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415916629] [2022-07-21 16:55:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 16:55:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 16:55:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-21 16:55:24,735 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 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-21 16:55:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:25,254 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-07-21 16:55:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 16:55:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 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 24 [2022-07-21 16:55:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:25,256 INFO L225 Difference]: With dead ends: 77 [2022-07-21 16:55:25,256 INFO L226 Difference]: Without dead ends: 77 [2022-07-21 16:55:25,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-07-21 16:55:25,257 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:25,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-21 16:55:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-21 16:55:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 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-21 16:55:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-21 16:55:25,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2022-07-21 16:55:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:25,259 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-21 16:55:25,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 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-21 16:55:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-21 16:55:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:55:25,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:25,260 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] [2022-07-21 16:55:25,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 16:55:25,260 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2022-07-21 16:55:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:25,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669345294] [2022-07-21 16:55:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,424 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-21 16:55:25,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:25,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669345294] [2022-07-21 16:55:25,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669345294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:25,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:25,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 16:55:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311377444] [2022-07-21 16:55:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:25,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 16:55:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:25,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 16:55:25,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:55:25,427 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-21 16:55:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:25,690 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-07-21 16:55:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 16:55:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 24 [2022-07-21 16:55:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:25,692 INFO L225 Difference]: With dead ends: 120 [2022-07-21 16:55:25,692 INFO L226 Difference]: Without dead ends: 120 [2022-07-21 16:55:25,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-21 16:55:25,693 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:25,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-21 16:55:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-07-21 16:55:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 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-21 16:55:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-07-21 16:55:25,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2022-07-21 16:55:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:25,696 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-07-21 16:55:25,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-21 16:55:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-07-21 16:55:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:55:25,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:25,697 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] [2022-07-21 16:55:25,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 16:55:25,697 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2022-07-21 16:55:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:25,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070476989] [2022-07-21 16:55:25,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,862 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-21 16:55:25,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:25,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070476989] [2022-07-21 16:55:25,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070476989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:25,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:25,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 16:55:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212483462] [2022-07-21 16:55:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:25,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 16:55:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 16:55:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:55:25,865 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-21 16:55:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,101 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-07-21 16:55:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 16:55:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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 24 [2022-07-21 16:55:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,102 INFO L225 Difference]: With dead ends: 156 [2022-07-21 16:55:26,102 INFO L226 Difference]: Without dead ends: 156 [2022-07-21 16:55:26,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-21 16:55:26,103 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 100 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 188 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-21 16:55:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2022-07-21 16:55:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 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-21 16:55:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-21 16:55:26,107 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2022-07-21 16:55:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,107 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-21 16:55:26,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-21 16:55:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-21 16:55:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 16:55:26,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,108 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-21 16:55:26,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 16:55:26,108 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2022-07-21 16:55:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:26,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576332273] [2022-07-21 16:55:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:26,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:26,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576332273] [2022-07-21 16:55:26,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576332273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:26,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:26,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:55:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342090455] [2022-07-21 16:55:26,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:26,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:55:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:55:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:26,303 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-21 16:55:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,341 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-07-21 16:55:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:55:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-21 16:55:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,342 INFO L225 Difference]: With dead ends: 104 [2022-07-21 16:55:26,342 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 16:55:26,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:26,343 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 16:55:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-21 16:55:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 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-21 16:55:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-07-21 16:55:26,347 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 27 [2022-07-21 16:55:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,347 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-07-21 16:55:26,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-21 16:55:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-07-21 16:55:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 16:55:26,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,348 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 16:55:26,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 16:55:26,348 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 235701316, now seen corresponding path program 1 times [2022-07-21 16:55:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:26,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480781147] [2022-07-21 16:55:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:26,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:26,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480781147] [2022-07-21 16:55:26,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480781147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:26,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176325149] [2022-07-21 16:55:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:26,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:26,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:26,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 16:55:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-21 16:55:26,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:26,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:26,927 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 9 treesize of output 11 [2022-07-21 16:55:26,937 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:55:26,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:55:26,988 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:26,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:26,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:55:27,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:27,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:27,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:55:27,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:27,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:28,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176325149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:28,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:28,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2022-07-21 16:55:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935714145] [2022-07-21 16:55:28,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:28,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 16:55:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 16:55:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2022-07-21 16:55:28,390 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 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-21 16:55:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:28,830 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-07-21 16:55:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 16:55:28,831 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 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 28 [2022-07-21 16:55:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:28,832 INFO L225 Difference]: With dead ends: 68 [2022-07-21 16:55:28,832 INFO L226 Difference]: Without dead ends: 68 [2022-07-21 16:55:28,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=2213, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 16:55:28,834 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:28,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 230 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-21 16:55:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-21 16:55:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-21 16:55:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.125) internal successors, (72), 66 states have internal predecessors, (72), 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-21 16:55:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-07-21 16:55:28,839 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 28 [2022-07-21 16:55:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:28,839 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-07-21 16:55:28,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 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-21 16:55:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-07-21 16:55:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 16:55:28,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:28,841 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] [2022-07-21 16:55:28,869 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-21 16:55:29,063 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,SelfDestructingSolverStorable20 [2022-07-21 16:55:29,064 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1959516773, now seen corresponding path program 1 times [2022-07-21 16:55:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462709244] [2022-07-21 16:55:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:29,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462709244] [2022-07-21 16:55:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462709244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241204613] [2022-07-21 16:55:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:29,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:29,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:29,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:29,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 16:55:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:29,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 16:55:29,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:29,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:29,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:55:29,426 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:29,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:29,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:29,738 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 27 treesize of output 23 [2022-07-21 16:55:29,823 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:55:29,824 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-21 16:55:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:29,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241204613] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:29,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:29,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-21 16:55:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404089344] [2022-07-21 16:55:29,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:29,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 16:55:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:29,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 16:55:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-07-21 16:55:29,841 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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-21 16:55:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:30,304 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-21 16:55:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 16:55:30,306 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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 28 [2022-07-21 16:55:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:30,307 INFO L225 Difference]: With dead ends: 99 [2022-07-21 16:55:30,307 INFO L226 Difference]: Without dead ends: 99 [2022-07-21 16:55:30,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 16:55:30,308 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 470 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:30,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 305 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 418 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2022-07-21 16:55:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-21 16:55:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2022-07-21 16:55:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 70 states have internal predecessors, (76), 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-21 16:55:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-21 16:55:30,311 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-07-21 16:55:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:30,311 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-21 16:55:30,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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-21 16:55:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-21 16:55:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 16:55:30,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:30,312 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 16:55:30,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:30,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:30,532 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash -615477817, now seen corresponding path program 1 times [2022-07-21 16:55:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:30,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579456719] [2022-07-21 16:55:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:55:30,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:30,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579456719] [2022-07-21 16:55:30,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579456719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:30,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950058474] [2022-07-21 16:55:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:30,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:30,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:30,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:30,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 16:55:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:31,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 16:55:31,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:31,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:31,044 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 9 treesize of output 11 [2022-07-21 16:55:31,047 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 10 treesize of output 8 [2022-07-21 16:55:31,117 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:31,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 16:55:31,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:31,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:31,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:55:31,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:55:31,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:32,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:55:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:55:32,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950058474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:32,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:32,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-07-21 16:55:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573680587] [2022-07-21 16:55:32,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:32,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-21 16:55:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-21 16:55:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2022-07-21 16:55:32,435 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 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-21 16:55:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:33,355 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-07-21 16:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 16:55:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 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 29 [2022-07-21 16:55:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:33,356 INFO L225 Difference]: With dead ends: 72 [2022-07-21 16:55:33,356 INFO L226 Difference]: Without dead ends: 72 [2022-07-21 16:55:33,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2022-07-21 16:55:33,357 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:33,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 334 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 202 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-07-21 16:55:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-21 16:55:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-21 16:55:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 71 states have internal predecessors, (77), 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-21 16:55:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-07-21 16:55:33,359 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 29 [2022-07-21 16:55:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:33,359 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-07-21 16:55:33,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 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-21 16:55:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-07-21 16:55:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 16:55:33,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:33,362 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 16:55:33,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:33,572 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:33,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1510311704, now seen corresponding path program 1 times [2022-07-21 16:55:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:33,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038486137] [2022-07-21 16:55:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:55:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038486137] [2022-07-21 16:55:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038486137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199904570] [2022-07-21 16:55:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:34,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:34,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:34,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:34,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 16:55:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:34,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-21 16:55:34,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:34,277 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:34,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:55:34,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:55:34,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:55:34,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:34,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 16:55:34,476 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:55:34,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:34,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:34,523 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 11 treesize of output 7 [2022-07-21 16:55:34,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:55:34,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:35,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:36,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:55:36,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:55:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:36,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199904570] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:36,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:36,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-07-21 16:55:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043409095] [2022-07-21 16:55:36,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:36,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-21 16:55:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-21 16:55:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2026, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 16:55:36,248 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 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-21 16:55:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:39,998 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-21 16:55:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 16:55:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 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 34 [2022-07-21 16:55:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:40,000 INFO L225 Difference]: With dead ends: 92 [2022-07-21 16:55:40,000 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 16:55:40,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=652, Invalid=5668, Unknown=0, NotChecked=0, Total=6320 [2022-07-21 16:55:40,002 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 259 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:40,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 541 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 844 Invalid, 0 Unknown, 206 Unchecked, 0.6s Time] [2022-07-21 16:55:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 16:55:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-21 16:55:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.155844155844156) internal successors, (89), 79 states have internal predecessors, (89), 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-21 16:55:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-21 16:55:40,005 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2022-07-21 16:55:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:40,005 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-21 16:55:40,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 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-21 16:55:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-21 16:55:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 16:55:40,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:40,006 INFO L195 NwaCegarLoop]: trace histogram [3, 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-21 16:55:40,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 16:55:40,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 16:55:40,220 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1489289572, now seen corresponding path program 2 times [2022-07-21 16:55:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:40,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607777283] [2022-07-21 16:55:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:40,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607777283] [2022-07-21 16:55:40,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607777283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713958411] [2022-07-21 16:55:40,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:40,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:40,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:40,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:40,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 16:55:40,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:40,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:40,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 16:55:40,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:40,707 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:55:40,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:55:40,821 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 14 treesize of output 10 [2022-07-21 16:55:40,866 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:40,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:40,900 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 17 treesize of output 19 [2022-07-21 16:55:40,906 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-21 16:55:41,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 16:55:41,092 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 17 treesize of output 19 [2022-07-21 16:55:41,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:55:41,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:41,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:41,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:55:41,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:41,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:41,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)))) is different from false [2022-07-21 16:55:41,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:41,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:41,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:41,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| v_ArrVal_915) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27|) 0)))) is different from false [2022-07-21 16:55:41,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:41,294 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 26 treesize of output 27 [2022-07-21 16:55:41,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:41,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-21 16:55:41,307 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 59 treesize of output 51 [2022-07-21 16:55:41,311 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 110 treesize of output 94 [2022-07-21 16:55:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 16:55:41,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713958411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:41,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:41,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 42 [2022-07-21 16:55:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18955325] [2022-07-21 16:55:41,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:41,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 16:55:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 16:55:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1024, Unknown=8, NotChecked=568, Total=1722 [2022-07-21 16:55:41,686 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 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-21 16:55:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:42,917 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-21 16:55:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 16:55:42,917 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 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 34 [2022-07-21 16:55:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:42,919 INFO L225 Difference]: With dead ends: 126 [2022-07-21 16:55:42,919 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 16:55:42,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=246, Invalid=2129, Unknown=9, NotChecked=808, Total=3192 [2022-07-21 16:55:42,920 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:42,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 626 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 710 Unchecked, 0.2s Time] [2022-07-21 16:55:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 16:55:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2022-07-21 16:55:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 103 states have internal predecessors, (115), 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-21 16:55:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-21 16:55:42,926 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 34 [2022-07-21 16:55:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:42,926 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-21 16:55:42,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 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-21 16:55:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-21 16:55:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 16:55:42,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:42,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:42,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:43,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:43,144 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -412898380, now seen corresponding path program 2 times [2022-07-21 16:55:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:43,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697763226] [2022-07-21 16:55:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:43,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697763226] [2022-07-21 16:55:43,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697763226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:43,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943530861] [2022-07-21 16:55:43,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:43,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:43,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:43,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:43,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 16:55:43,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:43,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:43,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-21 16:55:43,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:43,706 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:55:43,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:55:43,711 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 9 treesize of output 11 [2022-07-21 16:55:43,797 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:43,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 16:55:43,823 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:55:43,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:43,859 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 11 treesize of output 7 [2022-07-21 16:55:43,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:43,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:55:43,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:44,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943530861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:45,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-07-21 16:55:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101802833] [2022-07-21 16:55:45,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:45,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-21 16:55:45,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:45,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-21 16:55:45,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2722, Unknown=0, NotChecked=0, Total=2970 [2022-07-21 16:55:45,416 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 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-21 16:55:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:47,614 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-21 16:55:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 16:55:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 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 36 [2022-07-21 16:55:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:47,615 INFO L225 Difference]: With dead ends: 129 [2022-07-21 16:55:47,615 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 16:55:47,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=837, Invalid=7719, Unknown=0, NotChecked=0, Total=8556 [2022-07-21 16:55:47,618 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 257 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:47,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 605 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1120 Invalid, 0 Unknown, 56 Unchecked, 0.7s Time] [2022-07-21 16:55:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 16:55:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-21 16:55:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 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-21 16:55:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-21 16:55:47,620 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2022-07-21 16:55:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:47,620 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-21 16:55:47,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 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-21 16:55:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-21 16:55:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 16:55:47,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:47,623 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2022-07-21 16:55:47,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 16:55:47,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:47,836 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1201741191, now seen corresponding path program 3 times [2022-07-21 16:55:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:47,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565986901] [2022-07-21 16:55:47,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:47,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:48,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565986901] [2022-07-21 16:55:48,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565986901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:48,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882797557] [2022-07-21 16:55:48,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:55:48,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:48,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:48,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:48,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 16:55:48,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 16:55:48,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:48,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 16:55:48,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:48,266 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:48,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:55:48,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:48,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:55:48,369 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:48,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:48,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:48,747 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 27 treesize of output 23 [2022-07-21 16:55:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882797557] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:48,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-21 16:55:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945487006] [2022-07-21 16:55:48,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 16:55:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 16:55:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 16:55:48,951 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 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-21 16:55:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:49,432 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-21 16:55:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 16:55:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 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-21 16:55:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:49,432 INFO L225 Difference]: With dead ends: 54 [2022-07-21 16:55:49,433 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 16:55:49,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2022-07-21 16:55:49,434 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 280 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:49,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 226 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 325 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-07-21 16:55:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 16:55:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-07-21 16:55:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 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-21 16:55:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-21 16:55:49,436 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2022-07-21 16:55:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:49,436 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-21 16:55:49,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 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-21 16:55:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-07-21 16:55:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 16:55:49,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:49,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-21 16:55:49,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 16:55:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 16:55:49,644 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1400728745, now seen corresponding path program 2 times [2022-07-21 16:55:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192639950] [2022-07-21 16:55:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 16:55:50,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:50,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192639950] [2022-07-21 16:55:50,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192639950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:50,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952462599] [2022-07-21 16:55:50,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:50,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:50,156 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:50,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 16:55:50,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:50,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:50,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-21 16:55:50,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:50,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:50,321 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 9 treesize of output 11 [2022-07-21 16:55:50,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:55:50,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:55:50,401 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:50,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:50,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:55:50,445 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 11 treesize of output 7 [2022-07-21 16:55:50,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:50,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:55:50,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 16:55:51,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 16:55:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952462599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:51,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:51,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2022-07-21 16:55:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609595026] [2022-07-21 16:55:51,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:51,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-21 16:55:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-21 16:55:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 16:55:51,840 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 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-21 16:55:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:52,719 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-21 16:55:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 16:55:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 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 39 [2022-07-21 16:55:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:52,720 INFO L225 Difference]: With dead ends: 59 [2022-07-21 16:55:52,720 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 16:55:52,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=337, Invalid=3445, Unknown=0, NotChecked=0, Total=3782 [2022-07-21 16:55:52,721 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:52,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 266 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 264 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-21 16:55:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 16:55:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-07-21 16:55:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 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-21 16:55:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-07-21 16:55:52,723 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 39 [2022-07-21 16:55:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:52,723 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-07-21 16:55:52,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 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-21 16:55:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-07-21 16:55:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 16:55:52,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:52,724 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:52,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 16:55:52,948 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1072669446, now seen corresponding path program 4 times [2022-07-21 16:55:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:52,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555325136] [2022-07-21 16:55:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:53,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555325136] [2022-07-21 16:55:53,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555325136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:53,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828441670] [2022-07-21 16:55:53,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:55:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:53,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:53,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:53,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 16:55:53,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:55:53,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:53,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 16:55:53,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:53,803 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 10 treesize of output 8 [2022-07-21 16:55:53,981 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 14 treesize of output 10 [2022-07-21 16:55:54,024 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:54,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:55:54,087 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-21 16:55:54,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 16:55:54,322 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 17 treesize of output 19 [2022-07-21 16:55:54,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:54,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:54,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:55:54,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:54,719 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 17 treesize of output 10 [2022-07-21 16:55:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:54,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:54,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:55:54,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:54,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1364) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:55,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:55,140 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 26 treesize of output 27 [2022-07-21 16:55:55,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:55,147 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 141 treesize of output 135 [2022-07-21 16:55:55,151 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 118 treesize of output 102 [2022-07-21 16:55:55,156 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 102 treesize of output 94 [2022-07-21 16:55:55,589 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:55:55,589 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-21 16:55:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-21 16:55:55,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828441670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:55,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:55,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2022-07-21 16:55:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527942871] [2022-07-21 16:55:55,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:55,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-21 16:55:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:55,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-21 16:55:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3238, Unknown=4, NotChecked=348, Total=3782 [2022-07-21 16:55:55,635 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 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-21 16:55:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:55,963 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-07-21 16:55:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 16:55:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 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 44 [2022-07-21 16:55:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:55,964 INFO L225 Difference]: With dead ends: 91 [2022-07-21 16:55:55,964 INFO L226 Difference]: Without dead ends: 65 [2022-07-21 16:55:55,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=231, Invalid=3683, Unknown=4, NotChecked=372, Total=4290 [2022-07-21 16:55:55,965 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:55,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 791 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-21 16:55:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-21 16:55:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-07-21 16:55:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 61 states have internal predecessors, (64), 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-21 16:55:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-07-21 16:55:55,968 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 44 [2022-07-21 16:55:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:55,968 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-07-21 16:55:55,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 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-21 16:55:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-07-21 16:55:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 16:55:55,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:55,969 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:55,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:56,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-21 16:55:56,179 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 682791063, now seen corresponding path program 5 times [2022-07-21 16:55:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:56,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959551516] [2022-07-21 16:55:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:56,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959551516] [2022-07-21 16:55:56,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959551516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:56,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300009240] [2022-07-21 16:55:56,410 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:55:56,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:56,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:56,411 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:56,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 16:55:56,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-21 16:55:56,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:56,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 16:55:56,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:56,924 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:56,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:55:56,936 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:56,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:55:57,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:57,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:55:57,063 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:55:57,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:55:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:57,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:57,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300009240] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:57,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:57,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2022-07-21 16:55:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280987598] [2022-07-21 16:55:57,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 16:55:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 16:55:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 16:55:57,727 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 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-21 16:55:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:58,214 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-21 16:55:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 16:55:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 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 48 [2022-07-21 16:55:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:58,215 INFO L225 Difference]: With dead ends: 63 [2022-07-21 16:55:58,215 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 16:55:58,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=1752, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 16:55:58,217 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 278 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:58,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 224 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 401 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-21 16:55:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 16:55:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-21 16:55:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 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-21 16:55:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-07-21 16:55:58,219 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 48 [2022-07-21 16:55:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:58,219 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-07-21 16:55:58,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 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-21 16:55:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-07-21 16:55:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 16:55:58,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:58,220 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:58,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:58,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:58,435 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:55:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:58,436 INFO L85 PathProgramCache]: Analyzing trace with hash 337884900, now seen corresponding path program 2 times [2022-07-21 16:55:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:58,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919487582] [2022-07-21 16:55:58,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 16:55:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:58,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919487582] [2022-07-21 16:55:58,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919487582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:58,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684522968] [2022-07-21 16:55:58,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:58,967 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:58,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 16:55:59,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:59,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:59,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-21 16:55:59,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:59,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:59,191 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 9 treesize of output 11 [2022-07-21 16:55:59,201 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:55:59,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:55:59,338 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:59,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 16:55:59,352 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:55:59,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:59,383 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 11 treesize of output 7 [2022-07-21 16:55:59,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:59,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 16:55:59,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:55:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 16:55:59,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 16:56:00,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684522968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:00,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 53 [2022-07-21 16:56:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104408800] [2022-07-21 16:56:00,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:00,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-21 16:56:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-21 16:56:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2657, Unknown=0, NotChecked=0, Total=2862 [2022-07-21 16:56:00,836 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 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-21 16:56:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:03,726 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-07-21 16:56:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-21 16:56:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 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 54 [2022-07-21 16:56:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:03,727 INFO L225 Difference]: With dead ends: 116 [2022-07-21 16:56:03,727 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 16:56:03,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1006, Invalid=9500, Unknown=0, NotChecked=0, Total=10506 [2022-07-21 16:56:03,728 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 210 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:03,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 404 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 664 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2022-07-21 16:56:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 16:56:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-07-21 16:56:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 86 states have internal predecessors, (96), 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-21 16:56:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2022-07-21 16:56:03,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 54 [2022-07-21 16:56:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:03,732 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2022-07-21 16:56:03,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 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-21 16:56:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2022-07-21 16:56:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 16:56:03,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:03,733 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:03,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:03,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:03,958 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 358907032, now seen corresponding path program 6 times [2022-07-21 16:56:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:03,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301770341] [2022-07-21 16:56:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:04,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301770341] [2022-07-21 16:56:04,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301770341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637043806] [2022-07-21 16:56:04,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:56:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:04,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:04,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 16:56:04,888 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-21 16:56:04,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:04,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-21 16:56:04,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:04,904 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:56:04,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:56:05,130 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 14 treesize of output 10 [2022-07-21 16:56:05,184 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:56:05,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:05,225 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 17 treesize of output 19 [2022-07-21 16:56:05,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:56:05,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 16:56:05,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:56:05,536 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 17 treesize of output 19 [2022-07-21 16:56:05,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:05,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:05,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:56:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:05,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:05,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:56:05,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:05,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1793) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:05,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:05,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1792) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:05,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:05,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:05,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:05,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:05,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:05,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:05,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:05,767 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 26 treesize of output 27 [2022-07-21 16:56:05,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:05,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-21 16:56:05,776 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 118 treesize of output 110 [2022-07-21 16:56:05,779 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 110 treesize of output 94 [2022-07-21 16:56:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-21 16:56:06,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637043806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:06,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:06,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 60 [2022-07-21 16:56:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208147297] [2022-07-21 16:56:06,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:06,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-21 16:56:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-21 16:56:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2223, Unknown=11, NotChecked=1144, Total=3540 [2022-07-21 16:56:06,383 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 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-21 16:56:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:07,328 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-21 16:56:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 16:56:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 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 54 [2022-07-21 16:56:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:07,329 INFO L225 Difference]: With dead ends: 126 [2022-07-21 16:56:07,329 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 16:56:07,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=3807, Unknown=11, NotChecked=1474, Total=5550 [2022-07-21 16:56:07,330 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:07,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 895 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 623 Invalid, 0 Unknown, 698 Unchecked, 0.3s Time] [2022-07-21 16:56:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 16:56:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-07-21 16:56:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 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-21 16:56:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-21 16:56:07,333 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 54 [2022-07-21 16:56:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:07,333 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-21 16:56:07,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 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-21 16:56:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-21 16:56:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 16:56:07,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:07,334 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:07,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:07,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-21 16:56:07,535 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2070188021, now seen corresponding path program 7 times [2022-07-21 16:56:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:07,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414662250] [2022-07-21 16:56:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414662250] [2022-07-21 16:56:07,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414662250] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56165389] [2022-07-21 16:56:07,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:56:07,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:07,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:07,847 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:07,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 16:56:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:08,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 16:56:08,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:08,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:56:08,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:08,178 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:56:08,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:56:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:08,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:08,629 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 27 treesize of output 23 [2022-07-21 16:56:08,952 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:56:08,952 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-21 16:56:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:08,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56165389] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:08,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:08,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2022-07-21 16:56:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902520093] [2022-07-21 16:56:08,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:08,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 16:56:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 16:56:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1790, Unknown=0, NotChecked=0, Total=1980 [2022-07-21 16:56:08,957 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 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-21 16:56:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:09,584 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-21 16:56:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 16:56:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 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) Word has length 58 [2022-07-21 16:56:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:09,585 INFO L225 Difference]: With dead ends: 92 [2022-07-21 16:56:09,586 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 16:56:09,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2022-07-21 16:56:09,587 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 497 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:09,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 370 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 631 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2022-07-21 16:56:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 16:56:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-07-21 16:56:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.125) internal successors, (99), 90 states have internal predecessors, (99), 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-21 16:56:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-21 16:56:09,589 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 58 [2022-07-21 16:56:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:09,589 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-21 16:56:09,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 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-21 16:56:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-21 16:56:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 16:56:09,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:09,590 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:09,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:09,799 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -248680787, now seen corresponding path program 3 times [2022-07-21 16:56:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:09,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090715067] [2022-07-21 16:56:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 16:56:10,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090715067] [2022-07-21 16:56:10,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090715067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644998151] [2022-07-21 16:56:10,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:56:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:10,229 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:10,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 16:56:10,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-21 16:56:10,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:10,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-21 16:56:10,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:10,883 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:10,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:56:10,893 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:56:10,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:56:11,038 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:56:11,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:11,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:56:11,068 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 11 treesize of output 7 [2022-07-21 16:56:11,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:56:11,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-21 16:56:11,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:56:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 16:56:11,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 16:56:12,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644998151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:12,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:12,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 56 [2022-07-21 16:56:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430137718] [2022-07-21 16:56:12,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:12,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-21 16:56:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-21 16:56:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2941, Unknown=0, NotChecked=0, Total=3192 [2022-07-21 16:56:12,642 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 states have internal predecessors, (133), 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-21 16:56:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:14,879 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-21 16:56:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-21 16:56:14,879 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 states have internal predecessors, (133), 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 59 [2022-07-21 16:56:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:14,880 INFO L225 Difference]: With dead ends: 90 [2022-07-21 16:56:14,880 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 16:56:14,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=910, Invalid=6746, Unknown=0, NotChecked=0, Total=7656 [2022-07-21 16:56:14,881 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:14,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 337 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 905 Invalid, 0 Unknown, 3 Unchecked, 0.5s Time] [2022-07-21 16:56:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 16:56:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-21 16:56:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.0681818181818181) internal successors, (94), 89 states have internal predecessors, (94), 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-21 16:56:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-21 16:56:14,883 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 59 [2022-07-21 16:56:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:14,883 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-21 16:56:14,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 states have internal predecessors, (133), 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-21 16:56:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-21 16:56:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 16:56:14,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:14,884 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:14,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:15,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:15,099 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1595605642, now seen corresponding path program 8 times [2022-07-21 16:56:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:15,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055352483] [2022-07-21 16:56:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:15,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055352483] [2022-07-21 16:56:15,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055352483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:15,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599075676] [2022-07-21 16:56:15,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:56:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:15,846 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:15,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 16:56:16,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:56:16,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-21 16:56:16,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:16,073 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:56:16,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:56:16,311 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 14 treesize of output 10 [2022-07-21 16:56:16,359 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:56:16,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:56:16,410 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-21 16:56:16,416 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 17 treesize of output 19 [2022-07-21 16:56:16,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 16:56:16,611 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 17 treesize of output 19 [2022-07-21 16:56:16,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:56:16,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:16,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:16,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:16,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:56:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:16,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:16,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:56:16,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:16,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2267) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:16,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:16,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2266) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:16,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:16,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2265) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:16,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:16,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:16,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:16,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:16,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:16,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:17,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:17,051 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 26 treesize of output 27 [2022-07-21 16:56:17,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:17,057 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 71 treesize of output 71 [2022-07-21 16:56:17,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-21 16:56:17,063 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 50 treesize of output 42 [2022-07-21 16:56:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-21 16:56:17,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599075676] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:17,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:17,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 69 [2022-07-21 16:56:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727569978] [2022-07-21 16:56:17,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:17,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-21 16:56:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-21 16:56:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-21 16:56:17,677 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 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-21 16:56:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:18,499 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-07-21 16:56:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 16:56:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 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 64 [2022-07-21 16:56:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:18,500 INFO L225 Difference]: With dead ends: 135 [2022-07-21 16:56:18,500 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 16:56:18,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=280, Invalid=4049, Unknown=13, NotChecked=1820, Total=6162 [2022-07-21 16:56:18,501 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1004 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:18,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 953 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 1004 Unchecked, 0.2s Time] [2022-07-21 16:56:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 16:56:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-21 16:56:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.065217391304348) internal successors, (98), 93 states have internal predecessors, (98), 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-21 16:56:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-21 16:56:18,504 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 64 [2022-07-21 16:56:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:18,504 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-21 16:56:18,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 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-21 16:56:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-21 16:56:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 16:56:18,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:18,505 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:18,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-21 16:56:18,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-21 16:56:18,716 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1757527917, now seen corresponding path program 9 times [2022-07-21 16:56:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:18,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995899892] [2022-07-21 16:56:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:19,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:19,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995899892] [2022-07-21 16:56:19,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995899892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:19,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710379437] [2022-07-21 16:56:19,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:56:19,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:19,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:19,042 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:19,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 16:56:19,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-21 16:56:19,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:19,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 16:56:19,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:19,696 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:19,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:56:19,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:56:19,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:19,858 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:56:19,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:56:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:20,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:20,461 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 29 treesize of output 25 [2022-07-21 16:56:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:20,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710379437] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:20,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:20,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2022-07-21 16:56:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474915781] [2022-07-21 16:56:20,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:20,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-21 16:56:20,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:20,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-21 16:56:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2664, Unknown=0, NotChecked=0, Total=2970 [2022-07-21 16:56:20,878 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 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-21 16:56:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:21,629 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-07-21 16:56:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:56:21,629 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 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 68 [2022-07-21 16:56:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:21,630 INFO L225 Difference]: With dead ends: 94 [2022-07-21 16:56:21,630 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 16:56:21,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=686, Invalid=4284, Unknown=0, NotChecked=0, Total=4970 [2022-07-21 16:56:21,631 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 380 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:21,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 307 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 460 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-21 16:56:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 16:56:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 16:56:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 93 states have internal predecessors, (97), 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-21 16:56:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-07-21 16:56:21,634 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 68 [2022-07-21 16:56:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:21,634 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-07-21 16:56:21,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 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-21 16:56:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-07-21 16:56:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 16:56:21,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:21,635 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:21,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-21 16:56:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:21,843 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1529659500, now seen corresponding path program 10 times [2022-07-21 16:56:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695219994] [2022-07-21 16:56:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:22,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695219994] [2022-07-21 16:56:22,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695219994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:22,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439860800] [2022-07-21 16:56:22,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:56:22,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:22,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:22,741 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:22,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-21 16:56:23,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:56:23,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:23,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-21 16:56:23,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:23,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:56:23,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:56:23,812 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 14 treesize of output 10 [2022-07-21 16:56:23,875 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:56:23,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:23,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:56:23,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:56:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 16:56:24,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:56:24,292 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 17 treesize of output 19 [2022-07-21 16:56:24,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:24,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:24,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:24,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:24,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:56:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:24,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:24,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-21 16:56:24,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:24,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2636) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:24,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:24,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2635 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:24,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:24,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2634) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:24,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:24,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2633 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2633) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:24,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:24,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:24,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:24,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:24,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:24,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:24,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| Int)) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| v_ArrVal_2632) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39|) 0)))) is different from false [2022-07-21 16:56:24,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:24,666 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 26 treesize of output 27 [2022-07-21 16:56:24,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:24,672 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 141 treesize of output 135 [2022-07-21 16:56:24,679 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 118 treesize of output 102 [2022-07-21 16:56:24,682 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 102 treesize of output 94 [2022-07-21 16:56:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-21 16:56:25,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439860800] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:25,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:25,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29, 29] total 78 [2022-07-21 16:56:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151932459] [2022-07-21 16:56:25,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-21 16:56:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-21 16:56:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3620, Unknown=16, NotChecked=2160, Total=6006 [2022-07-21 16:56:25,505 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 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-21 16:56:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:27,014 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-07-21 16:56:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-21 16:56:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 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 74 [2022-07-21 16:56:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:27,015 INFO L225 Difference]: With dead ends: 145 [2022-07-21 16:56:27,015 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 16:56:27,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=352, Invalid=6171, Unknown=21, NotChecked=2768, Total=9312 [2022-07-21 16:56:27,016 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1218 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:27,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1391 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 824 Invalid, 0 Unknown, 1218 Unchecked, 0.3s Time] [2022-07-21 16:56:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 16:56:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2022-07-21 16:56:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 97 states have internal predecessors, (101), 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-21 16:56:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-07-21 16:56:27,018 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 74 [2022-07-21 16:56:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:27,018 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-07-21 16:56:27,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 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-21 16:56:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-07-21 16:56:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 16:56:27,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:27,019 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:27,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:27,219 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash -123927951, now seen corresponding path program 11 times [2022-07-21 16:56:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:27,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241584941] [2022-07-21 16:56:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:27,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241584941] [2022-07-21 16:56:27,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241584941] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:27,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275335594] [2022-07-21 16:56:27,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:56:27,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:27,617 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:27,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-21 16:56:34,932 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-21 16:56:34,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:34,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 16:56:34,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:34,959 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:34,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:56:34,968 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:34,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:56:35,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:56:35,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:56:35,245 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:56:35,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:56:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:35,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 66 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:36,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275335594] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:36,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:36,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2022-07-21 16:56:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083403346] [2022-07-21 16:56:36,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:36,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-21 16:56:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:36,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-21 16:56:36,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2468, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 16:56:36,633 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 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-21 16:56:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:37,529 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-07-21 16:56:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 16:56:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 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 78 [2022-07-21 16:56:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:37,530 INFO L225 Difference]: With dead ends: 98 [2022-07-21 16:56:37,530 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 16:56:37,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=606, Invalid=5094, Unknown=0, NotChecked=0, Total=5700 [2022-07-21 16:56:37,531 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 529 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 852 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2022-07-21 16:56:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 16:56:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-21 16:56:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 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-21 16:56:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-07-21 16:56:37,533 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 78 [2022-07-21 16:56:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:37,533 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-21 16:56:37,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 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-21 16:56:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-07-21 16:56:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-21 16:56:37,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:37,534 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:37,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:37,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:37,747 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2047124210, now seen corresponding path program 12 times [2022-07-21 16:56:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:37,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257383142] [2022-07-21 16:56:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:37,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257383142] [2022-07-21 16:56:38,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257383142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307684538] [2022-07-21 16:56:38,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:56:38,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:38,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:38,695 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:38,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-21 16:56:43,321 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-21 16:56:43,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:43,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 185 conjunts are in the unsatisfiable core [2022-07-21 16:56:43,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:43,360 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:56:43,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:56:43,828 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 14 treesize of output 10 [2022-07-21 16:56:43,891 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:56:43,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:56:43,942 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 17 treesize of output 19 [2022-07-21 16:56:43,948 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 11 treesize of output 7 [2022-07-21 16:56:43,953 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-21 16:56:44,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 16:56:44,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:56:44,203 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 17 treesize of output 19 [2022-07-21 16:56:44,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:44,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:44,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:44,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:44,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:45,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:45,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:56:45,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:45,229 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 17 treesize of output 10 [2022-07-21 16:56:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:45,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:45,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:56:45,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:45,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3058 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3058) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:45,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:45,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3057) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)))) is different from false [2022-07-21 16:56:45,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:45,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3056 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3056) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:45,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:45,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3055 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3055) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:45,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:45,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3054 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3054) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:45,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:45,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:45,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)))) is different from false [2022-07-21 16:56:45,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:45,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:45,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:45,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:45,427 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 26 treesize of output 27 [2022-07-21 16:56:45,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:45,432 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 71 treesize of output 71 [2022-07-21 16:56:45,436 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 28 treesize of output 24 [2022-07-21 16:56:45,439 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 50 treesize of output 42 [2022-07-21 16:56:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 113 not checked. [2022-07-21 16:56:46,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307684538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:46,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:46,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32, 32] total 95 [2022-07-21 16:56:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122829623] [2022-07-21 16:56:46,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:46,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-21 16:56:46,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-21 16:56:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5771, Unknown=17, NotChecked=2856, Total=8930 [2022-07-21 16:56:46,285 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 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-21 16:56:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:47,640 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2022-07-21 16:56:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 16:56:47,641 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 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 84 [2022-07-21 16:56:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:47,641 INFO L225 Difference]: With dead ends: 152 [2022-07-21 16:56:47,641 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 16:56:47,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 17 IntricatePredicates, 9 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=430, Invalid=9127, Unknown=17, NotChecked=3536, Total=13110 [2022-07-21 16:56:47,642 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:47,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1558 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 732 Invalid, 0 Unknown, 1635 Unchecked, 0.3s Time] [2022-07-21 16:56:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 16:56:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-21 16:56:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.04) internal successors, (104), 101 states have internal predecessors, (104), 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-21 16:56:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2022-07-21 16:56:47,645 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 84 [2022-07-21 16:56:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:47,645 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-21 16:56:47,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 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-21 16:56:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2022-07-21 16:56:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 16:56:47,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:47,646 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:47,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:47,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-21 16:56:47,859 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1064449423, now seen corresponding path program 13 times [2022-07-21 16:56:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119115765] [2022-07-21 16:56:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:48,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:48,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119115765] [2022-07-21 16:56:48,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119115765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:48,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366268824] [2022-07-21 16:56:48,369 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:56:48,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:48,372 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:48,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-21 16:56:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:48,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 16:56:48,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:48,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:56:48,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:48,979 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:56:48,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:56:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 66 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:49,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:49,665 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 27 treesize of output 23 [2022-07-21 16:56:50,327 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:56:50,327 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-21 16:56:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 55 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:50,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366268824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:50,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:50,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 58 [2022-07-21 16:56:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555994129] [2022-07-21 16:56:50,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:50,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-21 16:56:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-21 16:56:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3140, Unknown=0, NotChecked=0, Total=3422 [2022-07-21 16:56:50,331 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 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-21 16:56:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:51,621 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-21 16:56:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 16:56:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 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) Word has length 88 [2022-07-21 16:56:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:51,621 INFO L225 Difference]: With dead ends: 102 [2022-07-21 16:56:51,622 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 16:56:51,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1074, Invalid=6236, Unknown=0, NotChecked=0, Total=7310 [2022-07-21 16:56:51,622 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 749 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:51,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 720 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1013 Invalid, 0 Unknown, 99 Unchecked, 0.4s Time] [2022-07-21 16:56:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 16:56:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-21 16:56:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.03) internal successors, (103), 101 states have internal predecessors, (103), 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-21 16:56:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-07-21 16:56:51,624 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 88 [2022-07-21 16:56:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:51,624 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-07-21 16:56:51,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 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-21 16:56:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-07-21 16:56:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 16:56:51,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:51,625 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:51,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:51,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-21 16:56:51,826 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1646098544, now seen corresponding path program 14 times [2022-07-21 16:56:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:51,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626312256] [2022-07-21 16:56:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:52,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:52,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626312256] [2022-07-21 16:56:52,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626312256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:52,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629321720] [2022-07-21 16:56:52,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:56:52,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:52,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:52,877 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:52,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-21 16:56:53,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:56:53,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:53,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-21 16:56:53,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:53,183 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:56:53,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:56:53,687 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 14 treesize of output 10 [2022-07-21 16:56:53,757 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:56:53,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:53,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:56:53,819 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 17 treesize of output 19 [2022-07-21 16:56:53,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 16:56:54,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:56:54,227 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 17 treesize of output 19 [2022-07-21 16:56:54,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:54,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:54,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:54,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:54,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:54,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:56:54,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:56:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:54,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:54,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:56:54,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:54,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3524 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3524) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:54,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:54,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3523 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3523) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:54,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:54,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3522) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:54,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:54,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3521) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:54,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-21 16:56:54,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3520 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3520) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:54,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:54,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3519 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3519) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:54,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:56:54,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:56:54,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)))) is different from false [2022-07-21 16:56:54,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:54,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:54,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-21 16:56:54,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:54,878 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 26 treesize of output 27 [2022-07-21 16:56:54,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:54,884 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 71 treesize of output 71 [2022-07-21 16:56:54,888 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 28 treesize of output 24 [2022-07-21 16:56:54,891 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 50 treesize of output 42 [2022-07-21 16:56:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-21 16:56:55,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629321720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:55,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:55,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35, 35] total 96 [2022-07-21 16:56:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34151404] [2022-07-21 16:56:55,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:55,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-21 16:56:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-21 16:56:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=5647, Unknown=19, NotChecked=3192, Total=9120 [2022-07-21 16:56:55,961 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 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-21 16:56:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:58,214 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2022-07-21 16:56:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 16:56:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 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 94 [2022-07-21 16:56:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:58,216 INFO L225 Difference]: With dead ends: 165 [2022-07-21 16:56:58,216 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 16:56:58,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 135 SyntacticMatches, 15 SemanticMatches, 117 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=413, Invalid=9544, Unknown=19, NotChecked=4066, Total=14042 [2022-07-21 16:56:58,217 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:58,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2091 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1509 Invalid, 0 Unknown, 1877 Unchecked, 0.6s Time] [2022-07-21 16:56:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 16:56:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-07-21 16:56:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 105 states have internal predecessors, (107), 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-21 16:56:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-07-21 16:56:58,220 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 94 [2022-07-21 16:56:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:58,220 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-07-21 16:56:58,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 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-21 16:56:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-07-21 16:56:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 16:56:58,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:58,221 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:58,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:58,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:58,447 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:56:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash -45925907, now seen corresponding path program 15 times [2022-07-21 16:56:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:58,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118821540] [2022-07-21 16:56:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:58,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118821540] [2022-07-21 16:56:58,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118821540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:58,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362792969] [2022-07-21 16:56:58,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:56:58,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:58,928 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:58,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-21 16:57:05,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-21 16:57:05,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:05,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-21 16:57:05,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:05,878 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:57:05,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:57:05,901 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:57:05,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:57:06,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:57:06,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:57:06,330 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:57:06,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:57:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:06,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 120 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:07,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362792969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:07,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:07,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 69 [2022-07-21 16:57:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499515710] [2022-07-21 16:57:07,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:07,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-21 16:57:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:07,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-21 16:57:07,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=4329, Unknown=0, NotChecked=0, Total=4830 [2022-07-21 16:57:07,960 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 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-21 16:57:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:09,821 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2022-07-21 16:57:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 16:57:09,821 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 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 98 [2022-07-21 16:57:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:09,822 INFO L225 Difference]: With dead ends: 112 [2022-07-21 16:57:09,822 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 16:57:09,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1882, Invalid=8018, Unknown=0, NotChecked=0, Total=9900 [2022-07-21 16:57:09,823 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 731 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:09,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 519 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 782 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-07-21 16:57:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 16:57:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-07-21 16:57:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 109 states have internal predecessors, (111), 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-21 16:57:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-07-21 16:57:09,824 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 98 [2022-07-21 16:57:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:09,824 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-07-21 16:57:09,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 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-21 16:57:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-07-21 16:57:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 16:57:09,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:09,825 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:09,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:10,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:10,026 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:57:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -14055494, now seen corresponding path program 3 times [2022-07-21 16:57:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:10,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121908029] [2022-07-21 16:57:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 103 proven. 97 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 16:57:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121908029] [2022-07-21 16:57:11,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121908029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:11,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496199839] [2022-07-21 16:57:11,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:57:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:11,105 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:11,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-21 16:57:19,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-21 16:57:19,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:19,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 236 conjunts are in the unsatisfiable core [2022-07-21 16:57:19,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:19,369 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:57:19,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:57:19,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-21 16:57:20,169 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 16:57:20,170 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 22 treesize of output 33 [2022-07-21 16:57:20,193 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:57:20,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:57:20,254 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 11 treesize of output 7 [2022-07-21 16:57:20,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:57:20,388 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 33 treesize of output 17 [2022-07-21 16:57:20,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:57:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:23,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:32,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496199839] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:32,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:32,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 40, 40] total 110 [2022-07-21 16:57:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623619318] [2022-07-21 16:57:32,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:32,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-07-21 16:57:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-07-21 16:57:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=11205, Unknown=0, NotChecked=0, Total=12210 [2022-07-21 16:57:32,258 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 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-21 16:57:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:47,441 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2022-07-21 16:57:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-21 16:57:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 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 104 [2022-07-21 16:57:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:47,442 INFO L225 Difference]: With dead ends: 183 [2022-07-21 16:57:47,442 INFO L226 Difference]: Without dead ends: 175 [2022-07-21 16:57:47,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10760 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=3115, Invalid=35497, Unknown=0, NotChecked=0, Total=38612 [2022-07-21 16:57:47,444 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 345 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:47,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1181 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1539 Invalid, 0 Unknown, 977 Unchecked, 1.8s Time] [2022-07-21 16:57:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-21 16:57:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2022-07-21 16:57:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 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-21 16:57:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-07-21 16:57:47,447 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2022-07-21 16:57:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:47,447 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-07-21 16:57:47,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 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-21 16:57:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-07-21 16:57:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 16:57:47,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:47,448 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:47,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:47,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:47,661 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:57:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 6966638, now seen corresponding path program 16 times [2022-07-21 16:57:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:47,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818846487] [2022-07-21 16:57:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:48,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:48,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818846487] [2022-07-21 16:57:48,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818846487] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:48,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531393089] [2022-07-21 16:57:48,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:57:48,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:48,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:48,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:48,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-21 16:57:50,034 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:57:50,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:50,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 204 conjunts are in the unsatisfiable core [2022-07-21 16:57:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:50,064 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:57:50,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:57:50,744 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 14 treesize of output 10 [2022-07-21 16:57:50,812 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:57:50,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:57:50,886 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-21 16:57:50,890 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 17 treesize of output 19 [2022-07-21 16:57:50,898 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 11 treesize of output 7 [2022-07-21 16:57:51,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 16:57:51,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:57:51,240 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 17 treesize of output 19 [2022-07-21 16:57:51,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:57:51,737 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 17 treesize of output 19 [2022-07-21 16:57:51,969 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 17 treesize of output 19 [2022-07-21 16:57:52,186 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 17 treesize of output 19 [2022-07-21 16:57:52,425 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 17 treesize of output 19 [2022-07-21 16:57:52,684 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 17 treesize of output 19 [2022-07-21 16:57:52,896 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 17 treesize of output 19 [2022-07-21 16:57:53,116 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 17 treesize of output 19 [2022-07-21 16:57:53,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:57:53,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:53,351 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 18 treesize of output 10 [2022-07-21 16:57:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:53,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:53,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:57:53,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:57:53,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4321 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4321) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:57:53,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:57:53,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4320 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4320) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:57:53,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:57:53,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4319 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4319) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:57:53,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)))) is different from false [2022-07-21 16:57:53,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4318 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4318) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:57:53,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-21 16:57:53,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4317 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4317) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:57:53,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:57:53,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4316 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4316) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:57:53,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:57:53,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4315 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4315) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:57:53,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-21 16:57:53,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-21 16:57:53,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-21 16:57:53,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-21 16:57:53,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-21 16:57:53,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-21 16:57:53,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:53,759 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 26 treesize of output 27 [2022-07-21 16:57:53,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:53,766 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 71 treesize of output 71 [2022-07-21 16:57:53,770 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 54 treesize of output 46 [2022-07-21 16:57:53,775 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 24 treesize of output 20 [2022-07-21 16:57:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 198 not checked. [2022-07-21 16:57:55,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531393089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:55,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:55,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 39, 39] total 117 [2022-07-21 16:57:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096617505] [2022-07-21 16:57:55,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:55,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-21 16:57:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-21 16:57:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=8851, Unknown=21, NotChecked=4368, Total=13572 [2022-07-21 16:57:55,689 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 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-21 16:57:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:58,667 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2022-07-21 16:57:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-21 16:57:58,672 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 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 104 [2022-07-21 16:57:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:58,672 INFO L225 Difference]: With dead ends: 174 [2022-07-21 16:57:58,672 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 16:57:58,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 138 SyntacticMatches, 10 SemanticMatches, 146 ConstructedPredicates, 21 IntricatePredicates, 5 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=539, Invalid=15525, Unknown=22, NotChecked=5670, Total=21756 [2022-07-21 16:57:58,673 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1940 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:58,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2205 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 859 Invalid, 0 Unknown, 1940 Unchecked, 0.3s Time] [2022-07-21 16:57:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 16:57:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-21 16:57:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 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-21 16:57:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-07-21 16:57:58,676 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-07-21 16:57:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:58,676 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-07-21 16:57:58,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 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-21 16:57:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-07-21 16:57:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 16:57:58,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:58,677 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:58,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:58,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-21 16:57:58,891 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:57:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1020694645, now seen corresponding path program 17 times [2022-07-21 16:57:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722745861] [2022-07-21 16:57:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 91 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:59,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:59,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722745861] [2022-07-21 16:57:59,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722745861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:59,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930192580] [2022-07-21 16:57:59,457 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:57:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:59,458 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:59,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-21 16:58:09,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-21 16:58:09,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:09,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-21 16:58:09,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:09,621 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:09,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:58:09,630 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:09,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:58:10,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:10,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 16:58:10,086 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:58:10,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:58:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 120 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:10,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 153 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:12,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930192580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:12,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:12,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 69 [2022-07-21 16:58:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858056520] [2022-07-21 16:58:12,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:12,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-21 16:58:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-21 16:58:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=4312, Unknown=0, NotChecked=0, Total=4830 [2022-07-21 16:58:12,139 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 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-21 16:58:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:13,375 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-07-21 16:58:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 16:58:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 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 108 [2022-07-21 16:58:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:13,376 INFO L225 Difference]: With dead ends: 117 [2022-07-21 16:58:13,376 INFO L226 Difference]: Without dead ends: 117 [2022-07-21 16:58:13,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1496, Invalid=7246, Unknown=0, NotChecked=0, Total=8742 [2022-07-21 16:58:13,377 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 633 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:13,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 863 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1331 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2022-07-21 16:58:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-21 16:58:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-07-21 16:58:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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-21 16:58:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-21 16:58:13,381 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 108 [2022-07-21 16:58:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:13,381 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-21 16:58:13,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 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-21 16:58:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-21 16:58:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 16:58:13,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:13,383 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:13,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:13,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-21 16:58:13,596 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:58:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1842522996, now seen corresponding path program 18 times [2022-07-21 16:58:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:13,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056859952] [2022-07-21 16:58:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056859952] [2022-07-21 16:58:15,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056859952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344625842] [2022-07-21 16:58:15,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:58:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:15,072 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:58:15,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-21 16:58:41,292 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-07-21 16:58:41,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:41,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-21 16:58:41,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:41,330 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:58:41,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:58:41,999 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 14 treesize of output 10 [2022-07-21 16:58:42,076 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:58:42,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:42,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:42,154 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 17 treesize of output 19 [2022-07-21 16:58:42,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 16:58:42,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:58:42,602 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 17 treesize of output 19 [2022-07-21 16:58:42,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:42,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:42,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:42,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:42,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:43,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:43,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:43,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:58:43,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:58:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:43,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:43,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:58:43,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:43,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4888) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:43,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:58:43,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4887) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:58:43,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:58:43,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4886) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:58:43,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:43,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4885) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:43,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:58:43,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4884 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4884) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:58:43,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:58:43,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4883 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4883) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:58:43,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)))) is different from false [2022-07-21 16:58:43,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4882 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4882) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:58:43,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)))) is different from false [2022-07-21 16:58:43,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4881 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4881) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)))) is different from false [2022-07-21 16:58:43,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-21 16:58:43,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-21 16:58:43,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:58:43,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:58:43,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 9)) 0)) is different from false [2022-07-21 16:58:43,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 9)) 0)) is different from false [2022-07-21 16:58:43,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:43,547 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 26 treesize of output 27 [2022-07-21 16:58:43,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:43,554 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 141 treesize of output 135 [2022-07-21 16:58:43,558 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 118 treesize of output 102 [2022-07-21 16:58:43,578 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 102 treesize of output 94 [2022-07-21 16:58:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-21 16:58:45,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344625842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:45,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:45,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 41, 41] total 117 [2022-07-21 16:58:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292632766] [2022-07-21 16:58:45,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:45,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-21 16:58:45,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:45,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-21 16:58:45,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=8488, Unknown=23, NotChecked=4738, Total=13572 [2022-07-21 16:58:45,007 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 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-21 16:58:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:47,952 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-21 16:58:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 16:58:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 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 114 [2022-07-21 16:58:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:47,954 INFO L225 Difference]: With dead ends: 190 [2022-07-21 16:58:47,954 INFO L226 Difference]: Without dead ends: 122 [2022-07-21 16:58:47,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 162 SyntacticMatches, 16 SemanticMatches, 143 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=496, Invalid=14335, Unknown=23, NotChecked=6026, Total=20880 [2022-07-21 16:58:47,955 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3754 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:47,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2554 Invalid, 6040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2251 Invalid, 0 Unknown, 3754 Unchecked, 0.8s Time] [2022-07-21 16:58:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-21 16:58:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2022-07-21 16:58:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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-21 16:58:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-21 16:58:47,958 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-21 16:58:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:47,958 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-21 16:58:47,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 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-21 16:58:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-21 16:58:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 16:58:47,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:47,959 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:47,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:48,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-21 16:58:48,177 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:58:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1876047465, now seen corresponding path program 19 times [2022-07-21 16:58:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:48,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308428488] [2022-07-21 16:58:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:48,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308428488] [2022-07-21 16:58:48,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308428488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:48,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241703127] [2022-07-21 16:58:48,779 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:58:48,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:48,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:48,784 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:58:48,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-21 16:58:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:49,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-21 16:58:49,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:49,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:49,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:58:49,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:58:49,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:58:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:49,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:50,517 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 27 treesize of output 23 [2022-07-21 16:58:51,469 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:58:51,469 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-21 16:58:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 136 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:51,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241703127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:51,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:51,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 73 [2022-07-21 16:58:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756094993] [2022-07-21 16:58:51,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:51,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-07-21 16:58:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-07-21 16:58:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=4955, Unknown=0, NotChecked=0, Total=5402 [2022-07-21 16:58:51,474 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 states have internal predecessors, (286), 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-21 16:58:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:53,319 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2022-07-21 16:58:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 16:58:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 states have internal predecessors, (286), 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 118 [2022-07-21 16:58:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:53,320 INFO L225 Difference]: With dead ends: 127 [2022-07-21 16:58:53,320 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 16:58:53,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1897 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2186, Invalid=9586, Unknown=0, NotChecked=0, Total=11772 [2022-07-21 16:58:53,321 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 562 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:53,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 958 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1594 Invalid, 0 Unknown, 141 Unchecked, 0.6s Time] [2022-07-21 16:58:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 16:58:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-21 16:58:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 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-21 16:58:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2022-07-21 16:58:53,324 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 118 [2022-07-21 16:58:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:53,324 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2022-07-21 16:58:53,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 states have internal predecessors, (286), 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-21 16:58:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-07-21 16:58:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-21 16:58:53,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:53,325 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:53,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:53,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:53,547 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:58:53,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash 307297514, now seen corresponding path program 20 times [2022-07-21 16:58:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:53,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808246451] [2022-07-21 16:58:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:55,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808246451] [2022-07-21 16:58:55,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808246451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:55,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272295481] [2022-07-21 16:58:55,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:58:55,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:55,190 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:58:55,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-21 16:58:55,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:58:55,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:55,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 201 conjunts are in the unsatisfiable core [2022-07-21 16:58:55,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:55,576 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:58:55,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 16:58:56,402 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 14 treesize of output 10 [2022-07-21 16:58:56,490 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 16:58:56,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:56,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:56,565 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 17 treesize of output 19 [2022-07-21 16:58:56,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 16:58:56,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:58:57,036 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 17 treesize of output 19 [2022-07-21 16:58:57,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:57,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:58:57,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:58:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:57,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:57,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-21 16:58:57,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:57,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5500) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:57,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:58:57,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5499 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5499) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-21 16:58:57,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:58:57,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5498 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5498) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-21 16:58:57,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:57,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5497 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5497) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:57,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:58:57,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5496 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5496) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-21 16:58:57,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:58:57,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5495 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5495) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-21 16:58:57,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:58:57,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5494 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5494) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-21 16:58:57,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 16:58:57,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5493 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5493) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 16:58:57,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-21 16:58:57,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5492 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5492) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-21 16:58:57,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:58:57,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:58:57,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 10)) 0)) is different from false [2022-07-21 16:58:57,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 10)) 0)) is different from false [2022-07-21 16:58:57,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 10)) 0)) is different from false [2022-07-21 16:58:57,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 10)) 0)) is different from false [2022-07-21 16:58:57,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:57,994 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 26 treesize of output 27 [2022-07-21 16:58:58,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:58,000 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 71 treesize of output 71 [2022-07-21 16:58:58,003 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 54 treesize of output 46 [2022-07-21 16:58:58,005 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 24 treesize of output 20 [2022-07-21 16:58:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 309 not checked. [2022-07-21 16:58:59,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272295481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:59,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:59,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 44, 44] total 123 [2022-07-21 16:58:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608958977] [2022-07-21 16:58:59,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-07-21 16:58:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:59,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-07-21 16:58:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=9244, Unknown=25, NotChecked=5400, Total=15006 [2022-07-21 16:58:59,584 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 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-21 16:59:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:02,808 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2022-07-21 16:59:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-21 16:59:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 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 124 [2022-07-21 16:59:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:02,809 INFO L225 Difference]: With dead ends: 206 [2022-07-21 16:59:02,809 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 16:59:02,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 149 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=509, Invalid=15316, Unknown=25, NotChecked=6800, Total=22650 [2022-07-21 16:59:02,810 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2915 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:02,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2900 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2033 Invalid, 0 Unknown, 2915 Unchecked, 0.7s Time] [2022-07-21 16:59:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 16:59:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2022-07-21 16:59:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 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-21 16:59:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-07-21 16:59:02,813 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-07-21 16:59:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:02,814 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-07-21 16:59:02,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 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-21 16:59:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-07-21 16:59:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-21 16:59:02,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:02,815 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:02,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-21 16:59:03,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-21 16:59:03,031 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-21 16:59:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1115754873, now seen corresponding path program 21 times [2022-07-21 16:59:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391560480] [2022-07-21 16:59:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 153 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391560480] [2022-07-21 16:59:03,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391560480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429218719] [2022-07-21 16:59:03,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:59:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:03,645 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:59:03,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process