./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.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 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:59:29,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:59:29,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:59:29,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:59:29,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:59:29,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:59:29,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:59:29,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:59:29,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:59:29,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:59:29,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:59:29,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:59:29,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:59:29,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:59:29,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:59:29,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:59:29,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:59:29,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:59:29,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:59:29,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:59:29,251 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:59:29,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:59:29,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:59:29,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:59:29,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:59:29,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:59:29,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:59:29,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:59:29,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:59:29,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:59:29,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:59:29,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:59:29,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:59:29,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:59:29,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:59:29,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:59:29,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:59:29,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:59:29,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:59:29,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:59:29,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:59:29,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:59:29,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 05:59:29,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:59:29,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:59:29,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:59:29,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:59:29,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:59:29,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:59:29,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:59:29,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:59:29,312 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:59:29,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:59:29,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:59:29,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:59:29,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:59:29,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:59:29,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:59:29,314 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:59:29,314 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:59:29,314 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 05:59:29,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:59:29,315 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:59:29,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:59:29,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:59:29,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:59:29,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:59:29,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:59:29,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:59:29,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:59:29,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:59:29,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:59:29,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:59:29,318 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 -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2022-07-14 05:59:29,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:59:29,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:59:29,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:59:29,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:59:29,598 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:59:29,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-14 05:59:29,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00a9f808/2f1c918701d3401ab1c8ce563e3b769e/FLAGa5a522047 [2022-07-14 05:59:30,174 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:59:30,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-14 05:59:30,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00a9f808/2f1c918701d3401ab1c8ce563e3b769e/FLAGa5a522047 [2022-07-14 05:59:30,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00a9f808/2f1c918701d3401ab1c8ce563e3b769e [2022-07-14 05:59:30,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:59:30,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:59:30,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:59:30,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:59:30,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:59:30,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:59:30" (1/1) ... [2022-07-14 05:59:30,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a51e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:30, skipping insertion in model container [2022-07-14 05:59:30,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:59:30" (1/1) ... [2022-07-14 05:59:30,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:59:30,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:59:31,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:59:31,077 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:59:31,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:59:31,158 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:59:31,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31 WrapperNode [2022-07-14 05:59:31,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:59:31,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:59:31,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:59:31,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:59:31,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,220 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-07-14 05:59:31,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:59:31,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:59:31,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:59:31,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:59:31,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:59:31,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:59:31,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:59:31,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:59:31,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (1/1) ... [2022-07-14 05:59:31,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:59:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:31,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 05:59:31,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 05:59:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 05:59:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 05:59:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 05:59:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:59:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:59:31,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:59:31,456 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:59:31,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:59:31,647 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:59:31,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:59:31,655 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 05:59:31,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:31 BoogieIcfgContainer [2022-07-14 05:59:31,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:59:31,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:59:31,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:59:31,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:59:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:59:30" (1/3) ... [2022-07-14 05:59:31,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3a009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:59:31, skipping insertion in model container [2022-07-14 05:59:31,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:31" (2/3) ... [2022-07-14 05:59:31,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3a009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:59:31, skipping insertion in model container [2022-07-14 05:59:31,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:31" (3/3) ... [2022-07-14 05:59:31,665 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2022-07-14 05:59:31,678 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:59:31,678 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-14 05:59:31,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:59:31,728 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@e74b87a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e3c3260 [2022-07-14 05:59:31,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-14 05:59:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:31,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:31,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:31,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-14 05:59:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:31,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010100986] [2022-07-14 05:59:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:31,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010100986] [2022-07-14 05:59:31,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010100986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:31,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:31,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:59:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188970085] [2022-07-14 05:59:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:31,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:59:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:59:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:59:32,019 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:32,070 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-14 05:59:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:59:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 05:59:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:32,080 INFO L225 Difference]: With dead ends: 33 [2022-07-14 05:59:32,080 INFO L226 Difference]: Without dead ends: 31 [2022-07-14 05:59:32,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:59:32,084 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:32,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-14 05:59:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-14 05:59:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-14 05:59:32,113 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2022-07-14 05:59:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:32,113 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-14 05:59:32,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-14 05:59:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:32,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:32,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:32,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:59:32,116 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-14 05:59:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102627004] [2022-07-14 05:59:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:32,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:32,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102627004] [2022-07-14 05:59:32,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102627004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:32,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:32,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:32,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981165086] [2022-07-14 05:59:32,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:32,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:32,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:32,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:32,230 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:32,258 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-14 05:59:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 05:59:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:32,275 INFO L225 Difference]: With dead ends: 30 [2022-07-14 05:59:32,275 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 05:59:32,276 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-14 05:59:32,277 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:32,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 05:59:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-14 05:59:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-14 05:59:32,282 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2022-07-14 05:59:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:32,282 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-14 05:59:32,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-14 05:59:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:32,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:32,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:32,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:59:32,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-14 05:59:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192746866] [2022-07-14 05:59:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:32,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:32,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192746866] [2022-07-14 05:59:32,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192746866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:32,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:32,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335004089] [2022-07-14 05:59:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:32,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:32,326 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-14 05:59:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:32,356 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-14 05:59:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:32,357 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-14 05:59:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:32,360 INFO L225 Difference]: With dead ends: 53 [2022-07-14 05:59:32,361 INFO L226 Difference]: Without dead ends: 53 [2022-07-14 05:59:32,362 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-14 05:59:32,363 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 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-14 05:59:32,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-14 05:59:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-14 05:59:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-14 05:59:32,375 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-14 05:59:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:32,376 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-14 05:59:32,377 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-14 05:59:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-14 05:59:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:32,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:32,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:32,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:59:32,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-14 05:59:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141924248] [2022-07-14 05:59:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:32,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141924248] [2022-07-14 05:59:32,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141924248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:32,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:32,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857355005] [2022-07-14 05:59:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:32,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:32,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:32,470 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:32,547 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-14 05:59:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:32,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 05:59:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:32,550 INFO L225 Difference]: With dead ends: 57 [2022-07-14 05:59:32,551 INFO L226 Difference]: Without dead ends: 57 [2022-07-14 05:59:32,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:32,558 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:32,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-14 05:59:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-07-14 05:59:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-14 05:59:32,567 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2022-07-14 05:59:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:32,567 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-14 05:59:32,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-14 05:59:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:59:32,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:32,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:32,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:59:32,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 629680341, now seen corresponding path program 1 times [2022-07-14 05:59:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038360129] [2022-07-14 05:59:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038360129] [2022-07-14 05:59:32,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038360129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:32,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:32,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:59:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351684251] [2022-07-14 05:59:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:32,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:59:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:32,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:59:32,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:59:32,733 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:32,836 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-14 05:59:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:59:32,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-14 05:59:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:32,838 INFO L225 Difference]: With dead ends: 46 [2022-07-14 05:59:32,838 INFO L226 Difference]: Without dead ends: 46 [2022-07-14 05:59:32,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:59:32,844 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:32,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-14 05:59:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-07-14 05:59:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-07-14 05:59:32,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2022-07-14 05:59:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:32,855 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-14 05:59:32,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-07-14 05:59:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:59:32,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:32,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:32,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:59:32,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 629680340, now seen corresponding path program 1 times [2022-07-14 05:59:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187555509] [2022-07-14 05:59:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:32,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187555509] [2022-07-14 05:59:32,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187555509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:32,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:32,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547636652] [2022-07-14 05:59:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:32,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:32,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:32,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:32,903 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:32,945 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-14 05:59:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:32,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-14 05:59:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:32,946 INFO L225 Difference]: With dead ends: 36 [2022-07-14 05:59:32,946 INFO L226 Difference]: Without dead ends: 36 [2022-07-14 05:59:32,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-14 05:59:32,947 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:32,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-14 05:59:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-14 05:59:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-14 05:59:32,951 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2022-07-14 05:59:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:32,951 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-14 05:59:32,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-14 05:59:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:32,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:32,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:32,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:59:32,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745921, now seen corresponding path program 1 times [2022-07-14 05:59:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505550547] [2022-07-14 05:59:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:33,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505550547] [2022-07-14 05:59:33,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505550547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:33,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:33,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084967381] [2022-07-14 05:59:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:33,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:59:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:59:33,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:59:33,024 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:33,070 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-14 05:59:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-14 05:59:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:33,071 INFO L225 Difference]: With dead ends: 35 [2022-07-14 05:59:33,071 INFO L226 Difference]: Without dead ends: 35 [2022-07-14 05:59:33,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-14 05:59:33,073 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:33,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-14 05:59:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-14 05:59:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-14 05:59:33,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-07-14 05:59:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:33,082 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-14 05:59:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-07-14 05:59:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:33,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:33,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:33,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:59:33,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745920, now seen corresponding path program 1 times [2022-07-14 05:59:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:33,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938170141] [2022-07-14 05:59:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:33,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938170141] [2022-07-14 05:59:33,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938170141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:33,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:33,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412355892] [2022-07-14 05:59:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:33,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:59:33,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:59:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:59:33,198 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:33,248 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-14 05:59:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:59:33,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-14 05:59:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:33,249 INFO L225 Difference]: With dead ends: 41 [2022-07-14 05:59:33,249 INFO L226 Difference]: Without dead ends: 41 [2022-07-14 05:59:33,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:33,250 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:33,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-14 05:59:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-07-14 05:59:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-14 05:59:33,253 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2022-07-14 05:59:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:33,254 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-14 05:59:33,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-14 05:59:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:33,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:33,255 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:33,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:59:33,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-14 05:59:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:33,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521911528] [2022-07-14 05:59:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:33,339 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-14 05:59:33,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:33,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521911528] [2022-07-14 05:59:33,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521911528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:33,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979010322] [2022-07-14 05:59:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:33,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:33,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:33,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 05:59:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:33,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 05:59:33,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:33,558 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:59:33,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 05:59:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:33,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:33,802 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-14 05:59:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979010322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:33,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:33,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-14 05:59:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441932293] [2022-07-14 05:59:33,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:33,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:59:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:59:33,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:59:33,804 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:33,950 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-07-14 05:59:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:59:33,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:59:33,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:33,951 INFO L225 Difference]: With dead ends: 80 [2022-07-14 05:59:33,951 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 05:59:33,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:59:33,952 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:33,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 05:59:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2022-07-14 05:59:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-14 05:59:33,955 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2022-07-14 05:59:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:33,956 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-14 05:59:33,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-14 05:59:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 05:59:33,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:33,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:33,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:34,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:34,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -467610218, now seen corresponding path program 1 times [2022-07-14 05:59:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161518436] [2022-07-14 05:59:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:34,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161518436] [2022-07-14 05:59:34,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161518436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:34,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:34,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104317768] [2022-07-14 05:59:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:34,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:34,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:34,219 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:34,241 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-14 05:59:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:34,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 05:59:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:34,241 INFO L225 Difference]: With dead ends: 33 [2022-07-14 05:59:34,241 INFO L226 Difference]: Without dead ends: 33 [2022-07-14 05:59:34,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:34,242 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:34,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-14 05:59:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-14 05:59:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-14 05:59:34,244 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2022-07-14 05:59:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:34,245 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-14 05:59:34,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-14 05:59:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:34,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:34,246 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:34,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:59:34,246 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1625875758, now seen corresponding path program 1 times [2022-07-14 05:59:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913239090] [2022-07-14 05:59:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:34,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913239090] [2022-07-14 05:59:34,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913239090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:34,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:34,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215854620] [2022-07-14 05:59:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:34,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:34,282 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:34,308 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-07-14 05:59:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:59:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 05:59:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:34,309 INFO L225 Difference]: With dead ends: 61 [2022-07-14 05:59:34,311 INFO L226 Difference]: Without dead ends: 61 [2022-07-14 05:59:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:59:34,312 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:34,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-14 05:59:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-07-14 05:59:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) 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-14 05:59:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-14 05:59:34,323 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 14 [2022-07-14 05:59:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:34,323 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-14 05:59:34,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-14 05:59:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:34,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:34,326 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:34,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:59:34,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:34,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1968026960, now seen corresponding path program 1 times [2022-07-14 05:59:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886588160] [2022-07-14 05:59:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886588160] [2022-07-14 05:59:34,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886588160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:34,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:34,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:59:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270563978] [2022-07-14 05:59:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:34,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:59:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:59:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:34,401 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:34,485 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-07-14 05:59:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:59:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 05:59:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:34,486 INFO L225 Difference]: With dead ends: 69 [2022-07-14 05:59:34,487 INFO L226 Difference]: Without dead ends: 69 [2022-07-14 05:59:34,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:59:34,487 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:34,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-14 05:59:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-14 05:59:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-14 05:59:34,490 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 14 [2022-07-14 05:59:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:34,491 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-14 05:59:34,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-14 05:59:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:34,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:34,492 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:34,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 05:59:34,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1709861522, now seen corresponding path program 1 times [2022-07-14 05:59:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816821909] [2022-07-14 05:59:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:34,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816821909] [2022-07-14 05:59:34,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816821909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:34,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:34,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:59:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037511814] [2022-07-14 05:59:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:34,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:59:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:59:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:34,600 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:34,837 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-14 05:59:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:59:34,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 05:59:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:34,839 INFO L225 Difference]: With dead ends: 81 [2022-07-14 05:59:34,839 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 05:59:34,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:59:34,840 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:34,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 146 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 05:59:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-07-14 05:59:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 52 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-14 05:59:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-07-14 05:59:34,843 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2022-07-14 05:59:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:34,843 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-07-14 05:59:34,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-07-14 05:59:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:59:34,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:34,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:34,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:59:34,847 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011067, now seen corresponding path program 1 times [2022-07-14 05:59:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044304030] [2022-07-14 05:59:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:34,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044304030] [2022-07-14 05:59:34,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044304030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:34,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:34,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343191206] [2022-07-14 05:59:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:34,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:59:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:34,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:59:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:59:34,896 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 3.0) 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-14 05:59:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:34,950 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-07-14 05:59:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:59:34,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) 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-14 05:59:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:34,952 INFO L225 Difference]: With dead ends: 54 [2022-07-14 05:59:34,952 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 05:59:34,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:59:34,953 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:34,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 05:59:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-14 05:59:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-07-14 05:59:34,962 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2022-07-14 05:59:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:34,962 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-07-14 05:59:34,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) 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-14 05:59:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-07-14 05:59:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:59:34,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:34,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:34,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 05:59:34,964 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011066, now seen corresponding path program 1 times [2022-07-14 05:59:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051122161] [2022-07-14 05:59:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:35,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051122161] [2022-07-14 05:59:35,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051122161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:35,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:35,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:59:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905762210] [2022-07-14 05:59:35,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:35,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:59:35,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:59:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:59:35,038 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-14 05:59:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:35,111 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-07-14 05:59:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:59:35,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-14 05:59:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:35,112 INFO L225 Difference]: With dead ends: 66 [2022-07-14 05:59:35,112 INFO L226 Difference]: Without dead ends: 66 [2022-07-14 05:59:35,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:59:35,113 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:35,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-14 05:59:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-07-14 05:59:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 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-14 05:59:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-14 05:59:35,115 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2022-07-14 05:59:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:35,116 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-14 05:59:35,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-14 05:59:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-14 05:59:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:59:35,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:35,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:35,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:59:35,117 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -879845628, now seen corresponding path program 1 times [2022-07-14 05:59:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:35,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524648720] [2022-07-14 05:59:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:35,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524648720] [2022-07-14 05:59:35,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524648720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:35,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:35,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 05:59:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128963980] [2022-07-14 05:59:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:35,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 05:59:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 05:59:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:59:35,259 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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-14 05:59:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:35,434 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-14 05:59:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:59:35,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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-14 05:59:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:35,435 INFO L225 Difference]: With dead ends: 67 [2022-07-14 05:59:35,436 INFO L226 Difference]: Without dead ends: 67 [2022-07-14 05:59:35,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-14 05:59:35,436 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:35,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-14 05:59:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-14 05:59:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 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-14 05:59:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-14 05:59:35,438 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 15 [2022-07-14 05:59:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:35,438 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-14 05:59:35,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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-14 05:59:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-14 05:59:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 05:59:35,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:35,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:35,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 05:59:35,439 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1587978612, now seen corresponding path program 1 times [2022-07-14 05:59:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:35,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097206932] [2022-07-14 05:59:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:35,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097206932] [2022-07-14 05:59:35,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097206932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:35,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:35,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47852171] [2022-07-14 05:59:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:35,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:35,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:35,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:35,516 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:35,530 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-14 05:59:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-14 05:59:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:35,531 INFO L225 Difference]: With dead ends: 64 [2022-07-14 05:59:35,531 INFO L226 Difference]: Without dead ends: 38 [2022-07-14 05:59:35,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:35,532 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:35,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-14 05:59:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-14 05:59:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-14 05:59:35,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2022-07-14 05:59:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:35,536 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-14 05:59:35,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-14 05:59:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:59:35,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:35,537 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:35,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 05:59:35,538 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash 980027851, now seen corresponding path program 1 times [2022-07-14 05:59:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034474876] [2022-07-14 05:59:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:35,645 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-14 05:59:35,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:35,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034474876] [2022-07-14 05:59:35,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034474876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793735405] [2022-07-14 05:59:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:35,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:35,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:35,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:35,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 05:59:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:35,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 05:59:35,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:35,863 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-14 05:59:35,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:36,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 05:59:36,023 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-14 05:59:36,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793735405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:36,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:36,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-14 05:59:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224098815] [2022-07-14 05:59:36,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:36,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:59:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:59:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-14 05:59:36,025 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:36,318 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-14 05:59:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:59:36,319 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 05:59:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:36,319 INFO L225 Difference]: With dead ends: 63 [2022-07-14 05:59:36,319 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 05:59:36,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-14 05:59:36,320 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:36,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 122 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 05:59:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-07-14 05:59:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-14 05:59:36,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2022-07-14 05:59:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:36,322 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-14 05:59:36,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-14 05:59:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:59:36,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:36,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:36,531 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,SelfDestructingSolverStorable17 [2022-07-14 05:59:36,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash 358816956, now seen corresponding path program 1 times [2022-07-14 05:59:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:36,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791188429] [2022-07-14 05:59:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:36,727 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-14 05:59:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791188429] [2022-07-14 05:59:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791188429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229346781] [2022-07-14 05:59:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:36,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:36,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:36,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 05:59:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:36,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-14 05:59:36,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:36,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:36,843 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-14 05:59:36,847 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-14 05:59:37,176 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-14 05:59:37,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:37,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:59:37,586 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-14 05:59:37,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229346781] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:37,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:37,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-14 05:59:37,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200472017] [2022-07-14 05:59:37,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:37,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 05:59:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:37,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 05:59:37,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-07-14 05:59:37,588 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 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-14 05:59:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:39,293 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-14 05:59:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:59:39,293 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 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) Word has length 19 [2022-07-14 05:59:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:39,294 INFO L225 Difference]: With dead ends: 53 [2022-07-14 05:59:39,294 INFO L226 Difference]: Without dead ends: 24 [2022-07-14 05:59:39,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2022-07-14 05:59:39,295 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:39,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 226 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:59:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-14 05:59:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-14 05:59:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-14 05:59:39,297 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2022-07-14 05:59:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:39,297 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-14 05:59:39,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 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-14 05:59:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-14 05:59:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:59:39,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:39,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:39,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:39,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:39,508 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash 316092298, now seen corresponding path program 1 times [2022-07-14 05:59:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:39,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585661032] [2022-07-14 05:59:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:39,592 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-14 05:59:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:39,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585661032] [2022-07-14 05:59:39,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585661032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:39,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434945709] [2022-07-14 05:59:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:39,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:39,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:39,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:39,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 05:59:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:39,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 05:59:39,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:39,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:39,677 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-14 05:59:39,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 10 treesize of output 8 [2022-07-14 05:59:39,790 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-14 05:59:39,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:39,930 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-14 05:59:39,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434945709] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:39,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:39,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-14 05:59:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684636205] [2022-07-14 05:59:39,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 05:59:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:39,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 05:59:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-14 05:59:39,933 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 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-14 05:59:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:40,075 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-14 05:59:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:59:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 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) Word has length 19 [2022-07-14 05:59:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:40,076 INFO L225 Difference]: With dead ends: 25 [2022-07-14 05:59:40,076 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 05:59:40,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-07-14 05:59:40,077 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:40,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 05:59:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-14 05:59:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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-14 05:59:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-14 05:59:40,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-07-14 05:59:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:40,079 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-14 05:59:40,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 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-14 05:59:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-14 05:59:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:59:40,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:40,079 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:40,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:40,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:40,287 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2137348900, now seen corresponding path program 2 times [2022-07-14 05:59:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:40,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583472672] [2022-07-14 05:59:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583472672] [2022-07-14 05:59:40,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583472672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640361878] [2022-07-14 05:59:40,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:59:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:40,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:40,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 05:59:40,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:59:40,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:40,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 05:59:40,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:40,564 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-14 05:59:40,615 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-14 05:59:40,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 17 treesize of output 19 [2022-07-14 05:59:40,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:40,905 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 20 treesize of output 20 [2022-07-14 05:59:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:41,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:41,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-14 05:59:41,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)))) is different from false [2022-07-14 05:59:41,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:41,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 05:59:41,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:41,343 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 37 treesize of output 37 [2022-07-14 05:59:41,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 05:59:41,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:59:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 05:59:41,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640361878] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:41,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:41,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-14 05:59:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743927973] [2022-07-14 05:59:41,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:41,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 05:59:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:41,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 05:59:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=952, Unknown=3, NotChecked=126, Total=1190 [2022-07-14 05:59:41,505 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:42,042 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-14 05:59:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:59:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 05:59:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:42,043 INFO L225 Difference]: With dead ends: 46 [2022-07-14 05:59:42,043 INFO L226 Difference]: Without dead ends: 36 [2022-07-14 05:59:42,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=1783, Unknown=3, NotChecked=174, Total=2162 [2022-07-14 05:59:42,044 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:42,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 127 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-07-14 05:59:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-14 05:59:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-14 05:59:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-14 05:59:42,046 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2022-07-14 05:59:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:42,046 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-14 05:59:42,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-14 05:59:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 05:59:42,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:42,047 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:42,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:42,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:42,268 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 269887706, now seen corresponding path program 3 times [2022-07-14 05:59:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:42,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181498514] [2022-07-14 05:59:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:42,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181498514] [2022-07-14 05:59:42,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181498514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:42,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923999558] [2022-07-14 05:59:42,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:59:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:42,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:42,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:42,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 05:59:42,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:59:42,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:42,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-14 05:59:42,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:42,651 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-14 05:59:42,753 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-14 05:59:42,808 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-14 05:59:42,862 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-14 05:59:42,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:59:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:42,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:42,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 05:59:42,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 05:59:42,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 05:59:42,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:42,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:42,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:42,971 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 23 treesize of output 24 [2022-07-14 05:59:42,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:42,976 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 37 treesize of output 37 [2022-07-14 05:59:42,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:59:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-14 05:59:43,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923999558] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:43,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:43,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2022-07-14 05:59:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583847226] [2022-07-14 05:59:43,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:43,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 05:59:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 05:59:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2022-07-14 05:59:43,142 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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-14 05:59:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:43,581 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-14 05:59:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:59:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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) Word has length 30 [2022-07-14 05:59:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:43,582 INFO L225 Difference]: With dead ends: 52 [2022-07-14 05:59:43,582 INFO L226 Difference]: Without dead ends: 38 [2022-07-14 05:59:43,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1063, Unknown=5, NotChecked=350, Total=1560 [2022-07-14 05:59:43,584 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:43,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-14 05:59:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-14 05:59:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-14 05:59:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-14 05:59:43,585 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-07-14 05:59:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:43,585 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-14 05:59:43,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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-14 05:59:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-14 05:59:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 05:59:43,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:43,586 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:43,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:43,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:43,787 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -826784969, now seen corresponding path program 4 times [2022-07-14 05:59:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:43,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176566666] [2022-07-14 05:59:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176566666] [2022-07-14 05:59:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176566666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394629703] [2022-07-14 05:59:43,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 05:59:43,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:43,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:43,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:59:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 05:59:44,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 05:59:44,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:44,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-14 05:59:44,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:44,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 10 treesize of output 8 [2022-07-14 05:59:44,065 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-14 05:59:44,228 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 16 treesize of output 12 [2022-07-14 05:59:44,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:59:44,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 05:59:44,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:44,520 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 21 treesize of output 21 [2022-07-14 05:59:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:44,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:45,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:45,119 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 23 treesize of output 24 [2022-07-14 05:59:45,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:45,128 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 37 treesize of output 37 [2022-07-14 05:59:45,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:59:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:45,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394629703] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:45,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:45,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2022-07-14 05:59:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224310605] [2022-07-14 05:59:45,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:45,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 05:59:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 05:59:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1518, Unknown=2, NotChecked=0, Total=1722 [2022-07-14 05:59:45,447 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 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-14 05:59:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:46,391 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-14 05:59:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 05:59:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 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) Word has length 34 [2022-07-14 05:59:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:46,393 INFO L225 Difference]: With dead ends: 43 [2022-07-14 05:59:46,393 INFO L226 Difference]: Without dead ends: 43 [2022-07-14 05:59:46,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=491, Invalid=2925, Unknown=6, NotChecked=0, Total=3422 [2022-07-14 05:59:46,394 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:46,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 172 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 348 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-07-14 05:59:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-14 05:59:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-14 05:59:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-14 05:59:46,396 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-14 05:59:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:46,397 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-14 05:59:46,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 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-14 05:59:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-14 05:59:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:59:46,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:46,398 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:46,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:46,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:46,616 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2031773033, now seen corresponding path program 5 times [2022-07-14 05:59:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:46,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235690468] [2022-07-14 05:59:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:46,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:46,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235690468] [2022-07-14 05:59:46,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235690468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:46,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674869820] [2022-07-14 05:59:46,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 05:59:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:46,906 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-14 05:59:46,947 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-14 05:59:47,045 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-14 05:59:47,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:47,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 05:59:47,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:47,060 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:59:47,061 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-14 05:59:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:47,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674869820] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:47,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:47,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-07-14 05:59:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888528241] [2022-07-14 05:59:47,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:47,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 05:59:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 05:59:47,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-07-14 05:59:47,518 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 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-14 05:59:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:47,947 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-14 05:59:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 05:59:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 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) Word has length 42 [2022-07-14 05:59:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:47,947 INFO L225 Difference]: With dead ends: 70 [2022-07-14 05:59:47,948 INFO L226 Difference]: Without dead ends: 50 [2022-07-14 05:59:47,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-07-14 05:59:47,949 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:47,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 101 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:59:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-14 05:59:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-14 05:59:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-14 05:59:47,951 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-07-14 05:59:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:47,951 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-14 05:59:47,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 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-14 05:59:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-14 05:59:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:59:47,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:47,952 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:47,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 05:59:48,163 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,SelfDestructingSolverStorable23 [2022-07-14 05:59:48,164 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1224662086, now seen corresponding path program 6 times [2022-07-14 05:59:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:48,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613411776] [2022-07-14 05:59:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:48,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613411776] [2022-07-14 05:59:48,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613411776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:48,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786568960] [2022-07-14 05:59:48,604 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 05:59:48,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:48,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:48,607 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-14 05:59:48,608 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-14 05:59:48,723 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-14 05:59:48,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:48,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-14 05:59:48,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:48,735 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-14 05:59:48,947 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-14 05:59:49,070 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-14 05:59:49,135 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-14 05:59:49,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:59:49,223 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-14 05:59:49,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:59:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:49,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:49,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 05:59:49,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)))) is different from false [2022-07-14 05:59:49,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_434) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 05:59:49,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:49,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_433) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:49,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:49,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_432) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:49,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:49,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-14 05:59:49,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:49,333 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 23 treesize of output 24 [2022-07-14 05:59:49,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:49,339 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 37 treesize of output 37 [2022-07-14 05:59:49,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:59:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-07-14 05:59:49,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786568960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:49,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:49,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 50 [2022-07-14 05:59:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904653597] [2022-07-14 05:59:49,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:49,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 05:59:49,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:49,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 05:59:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1525, Unknown=9, NotChecked=774, Total=2450 [2022-07-14 05:59:49,563 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:50,401 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-14 05:59:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 05:59:50,401 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-14 05:59:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:50,402 INFO L225 Difference]: With dead ends: 76 [2022-07-14 05:59:50,402 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 05:59:50,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=2464, Unknown=9, NotChecked=972, Total=3660 [2022-07-14 05:59:50,403 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:50,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 396 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 756 Invalid, 0 Unknown, 400 Unchecked, 0.3s Time] [2022-07-14 05:59:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 05:59:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-14 05:59:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-14 05:59:50,405 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-07-14 05:59:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:50,405 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-14 05:59:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-14 05:59:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 05:59:50,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:50,406 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:50,426 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-14 05:59:50,619 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,SelfDestructingSolverStorable24 [2022-07-14 05:59:50,620 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 300063907, now seen corresponding path program 7 times [2022-07-14 05:59:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:50,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800702401] [2022-07-14 05:59:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800702401] [2022-07-14 05:59:50,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800702401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590455060] [2022-07-14 05:59:50,838 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 05:59:50,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:50,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:50,840 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-14 05:59:50,848 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-14 05:59:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:50,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 05:59:50,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:51,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:51,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 05:59:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:51,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590455060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:51,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:51,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-14 05:59:51,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687821706] [2022-07-14 05:59:51,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:51,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 05:59:51,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:51,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 05:59:51,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 05:59:51,445 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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-14 05:59:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:51,919 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-14 05:59:51,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 05:59:51,919 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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) Word has length 50 [2022-07-14 05:59:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:51,920 INFO L225 Difference]: With dead ends: 57 [2022-07-14 05:59:51,920 INFO L226 Difference]: Without dead ends: 57 [2022-07-14 05:59:51,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 05:59:51,921 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 134 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:51,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 192 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:59:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-14 05:59:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-14 05:59:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 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-14 05:59:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-14 05:59:51,922 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-07-14 05:59:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:51,924 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-14 05:59:51,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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-14 05:59:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-14 05:59:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 05:59:51,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:51,925 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:51,952 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-14 05:59:52,126 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,SelfDestructingSolverStorable25 [2022-07-14 05:59:52,126 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 05:59:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -265764356, now seen corresponding path program 8 times [2022-07-14 05:59:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:52,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108928953] [2022-07-14 05:59:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108928953] [2022-07-14 05:59:52,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108928953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688935222] [2022-07-14 05:59:52,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:59:52,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:52,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:52,680 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-14 05:59:52,687 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-14 05:59:52,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:59:52,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:52,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-14 05:59:52,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:52,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-14 05:59:52,980 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-14 05:59:53,198 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-14 05:59:53,333 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-14 05:59:53,493 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-14 05:59:53,639 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-14 05:59:53,800 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-14 05:59:53,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:53,960 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 20 treesize of output 20 [2022-07-14 05:59:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:54,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:55,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-14 05:59:55,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-14 05:59:55,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:55,212 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 23 treesize of output 24 [2022-07-14 05:59:55,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:55,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-14 05:59:55,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:59:55,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 05:59:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-14 05:59:55,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688935222] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:55,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:55,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 75 [2022-07-14 05:59:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588644412] [2022-07-14 05:59:55,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:55,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-14 05:59:55,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:55,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-14 05:59:55,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=4890, Unknown=7, NotChecked=286, Total=5550 [2022-07-14 05:59:55,688 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:59,901 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-14 05:59:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-14 05:59:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 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-14 05:59:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:59,902 INFO L225 Difference]: With dead ends: 94 [2022-07-14 05:59:59,902 INFO L226 Difference]: Without dead ends: 68 [2022-07-14 05:59:59,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=800, Invalid=9503, Unknown=7, NotChecked=402, Total=10712 [2022-07-14 05:59:59,905 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 430 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 602 Unchecked, 0.2s Time] [2022-07-14 05:59:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-14 05:59:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-07-14 05:59:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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-14 05:59:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-14 05:59:59,906 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 54 [2022-07-14 05:59:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:59,907 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-14 05:59:59,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-14 05:59:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 05:59:59,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:59,907 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:59,924 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-14 06:00:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 06:00:00,108 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1063800910, now seen corresponding path program 9 times [2022-07-14 06:00:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219387481] [2022-07-14 06:00:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:00,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:00,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219387481] [2022-07-14 06:00:00,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219387481] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675963321] [2022-07-14 06:00:00,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:00:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:00,794 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-14 06:00:00,794 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-14 06:00:01,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-14 06:00:01,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:01,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-14 06:00:01,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:01,046 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-14 06:00:01,221 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-14 06:00:01,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 14 treesize of output 16 [2022-07-14 06:00:01,382 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-14 06:00:01,474 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-14 06:00:01,568 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-14 06:00:01,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:00:01,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:00:01,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:00:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:01,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:01,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:01,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:00:01,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_631) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:00:01,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_630) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_629) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_628) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_627) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:01,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:01,934 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 23 treesize of output 24 [2022-07-14 06:00:01,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:01,942 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 37 treesize of output 37 [2022-07-14 06:00:01,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:00:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 83 not checked. [2022-07-14 06:00:02,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675963321] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:02,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:02,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 69 [2022-07-14 06:00:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505617219] [2022-07-14 06:00:02,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:02,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-14 06:00:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-14 06:00:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-14 06:00:02,313 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:03,787 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-14 06:00:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 06:00:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 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 62 [2022-07-14 06:00:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:03,788 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:00:03,788 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:00:03,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 85 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=288, Invalid=4581, Unknown=13, NotChecked=1924, Total=6806 [2022-07-14 06:00:03,789 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:03,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 573 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1303 Invalid, 0 Unknown, 678 Unchecked, 0.6s Time] [2022-07-14 06:00:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:00:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-14 06:00:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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-14 06:00:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-07-14 06:00:03,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-07-14 06:00:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:03,791 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-07-14 06:00:03,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-07-14 06:00:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 06:00:03,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:03,792 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:03,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-14 06:00:03,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 06:00:03,999 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 397481487, now seen corresponding path program 10 times [2022-07-14 06:00:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480011328] [2022-07-14 06:00:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480011328] [2022-07-14 06:00:04,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480011328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257384981] [2022-07-14 06:00:04,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:00:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:04,383 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-14 06:00:04,384 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-14 06:00:04,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:00:04,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:04,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-14 06:00:04,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:04,507 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:04,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:00:04,515 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-14 06:00:04,901 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 16 treesize of output 12 [2022-07-14 06:00:05,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:05,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:05,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:05,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 18 treesize of output 20 [2022-07-14 06:00:05,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:05,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:05,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:05,755 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 21 treesize of output 21 [2022-07-14 06:00:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:05,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:06,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-14 06:00:06,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0))) is different from false [2022-07-14 06:00:07,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:07,000 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 23 treesize of output 24 [2022-07-14 06:00:07,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:07,009 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 37 treesize of output 37 [2022-07-14 06:00:07,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:00:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-14 06:00:08,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257384981] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:08,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:08,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 28] total 74 [2022-07-14 06:00:08,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920796176] [2022-07-14 06:00:08,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:08,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-14 06:00:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:08,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-14 06:00:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=4717, Unknown=8, NotChecked=286, Total=5550 [2022-07-14 06:00:08,172 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:10,315 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1))) (and (<= .cse0 .cse1) (<= |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 7) (<= 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 7 .cse1) (or (= |c_ULTIMATE.start_cstrncpy_#t~mem5#1| 0) (not (= (+ (- 1) .cse1) (+ (- 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) (or (and (<= (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse1) (<= 0 .cse0)) (forall ((v_ArrVal_713 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0))))) is different from false [2022-07-14 06:00:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:10,550 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-14 06:00:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 06:00:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 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 66 [2022-07-14 06:00:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:10,550 INFO L225 Difference]: With dead ends: 75 [2022-07-14 06:00:10,551 INFO L226 Difference]: Without dead ends: 75 [2022-07-14 06:00:10,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1394, Invalid=8284, Unknown=36, NotChecked=588, Total=10302 [2022-07-14 06:00:10,552 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:10,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 940 Invalid, 0 Unknown, 536 Unchecked, 0.5s Time] [2022-07-14 06:00:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-14 06:00:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-14 06:00:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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-14 06:00:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-14 06:00:10,554 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-14 06:00:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:10,554 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-14 06:00:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-14 06:00:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 06:00:10,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:10,555 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:10,575 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-14 06:00:10,763 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,SelfDestructingSolverStorable28 [2022-07-14 06:00:10,763 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2032213951, now seen corresponding path program 11 times [2022-07-14 06:00:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:10,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003156010] [2022-07-14 06:00:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 139 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003156010] [2022-07-14 06:00:11,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003156010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401659577] [2022-07-14 06:00:11,108 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:00:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:11,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:11,110 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-14 06:00:11,127 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-14 06:00:11,513 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-14 06:00:11,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:11,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-14 06:00:11,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:11,534 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:11,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:00:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:12,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:12,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401659577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:12,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:12,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2022-07-14 06:00:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148949613] [2022-07-14 06:00:12,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:12,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 06:00:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 06:00:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2138, Unknown=0, NotChecked=0, Total=2550 [2022-07-14 06:00:12,525 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:13,228 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-07-14 06:00:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:00:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 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-14 06:00:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:13,229 INFO L225 Difference]: With dead ends: 118 [2022-07-14 06:00:13,229 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:00:13,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=894, Invalid=3936, Unknown=0, NotChecked=0, Total=4830 [2022-07-14 06:00:13,230 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:13,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:00:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:00:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-14 06:00:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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-14 06:00:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-14 06:00:13,233 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-07-14 06:00:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:13,233 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-14 06:00:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-14 06:00:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-14 06:00:13,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:13,234 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:13,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-14 06:00:13,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:13,439 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -626482402, now seen corresponding path program 12 times [2022-07-14 06:00:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:13,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508366094] [2022-07-14 06:00:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:14,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508366094] [2022-07-14 06:00:14,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508366094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:14,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721612774] [2022-07-14 06:00:14,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:00:14,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:14,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:14,658 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-14 06:00:14,659 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-14 06:00:15,301 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-14 06:00:15,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:15,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-14 06:00:15,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:15,326 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-14 06:00:15,796 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-14 06:00:15,962 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-14 06:00:16,034 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-14 06:00:16,089 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-14 06:00:16,142 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-14 06:00:16,194 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-14 06:00:16,257 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-14 06:00:16,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 06:00:16,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 14 treesize of output 16 [2022-07-14 06:00:16,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:00:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:16,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:16,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:16,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:00:16,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_885) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:00:16,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_884) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_883) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_882) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_881) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_879) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:16,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:16,515 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 23 treesize of output 24 [2022-07-14 06:00:16,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:16,523 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 37 treesize of output 37 [2022-07-14 06:00:16,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:00:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 143 not checked. [2022-07-14 06:00:16,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721612774] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:16,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:16,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 80 [2022-07-14 06:00:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339130899] [2022-07-14 06:00:16,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:16,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-14 06:00:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:16,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-14 06:00:16,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3735, Unknown=17, NotChecked=2346, Total=6320 [2022-07-14 06:00:16,967 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:18,857 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2022-07-14 06:00:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-14 06:00:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 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-14 06:00:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:18,858 INFO L225 Difference]: With dead ends: 124 [2022-07-14 06:00:18,858 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 06:00:18,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=353, Invalid=6504, Unknown=17, NotChecked=3026, Total=9900 [2022-07-14 06:00:18,859 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:18,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 808 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1731 Invalid, 0 Unknown, 1153 Unchecked, 0.6s Time] [2022-07-14 06:00:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 06:00:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-14 06:00:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-07-14 06:00:18,863 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-07-14 06:00:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:18,863 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-07-14 06:00:18,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-07-14 06:00:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 06:00:18,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:18,864 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:18,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-14 06:00:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:19,072 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash -605311109, now seen corresponding path program 13 times [2022-07-14 06:00:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:19,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983778023] [2022-07-14 06:00:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:19,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:19,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983778023] [2022-07-14 06:00:19,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983778023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:19,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704867979] [2022-07-14 06:00:19,600 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:00:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:19,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:19,604 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-14 06:00:19,606 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-14 06:00:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:19,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-14 06:00:19,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:20,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:20,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:00:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:20,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704867979] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:20,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:20,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 50 [2022-07-14 06:00:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639589167] [2022-07-14 06:00:20,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:20,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 06:00:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 06:00:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2022-07-14 06:00:20,755 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:21,674 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-14 06:00:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 06:00:21,675 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 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 82 [2022-07-14 06:00:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:21,675 INFO L225 Difference]: With dead ends: 89 [2022-07-14 06:00:21,675 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 06:00:21,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2022-07-14 06:00:21,676 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 381 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:21,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 364 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:00:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 06:00:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-14 06:00:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-14 06:00:21,679 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-07-14 06:00:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:21,679 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-14 06:00:21,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-14 06:00:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 06:00:21,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:21,680 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:21,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:00:21,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:21,892 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1757632300, now seen corresponding path program 14 times [2022-07-14 06:00:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:21,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929170763] [2022-07-14 06:00:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:23,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929170763] [2022-07-14 06:00:23,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929170763] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:23,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055733391] [2022-07-14 06:00:23,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:00:23,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:23,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:23,083 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-14 06:00:23,084 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-14 06:00:23,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:00:23,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:23,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 169 conjunts are in the unsatisfiable core [2022-07-14 06:00:23,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:23,250 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-14 06:00:23,637 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-14 06:00:23,894 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-14 06:00:24,099 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-14 06:00:24,307 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-14 06:00:24,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:00:24,784 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-14 06:00:24,966 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-14 06:00:25,159 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-14 06:00:25,343 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-14 06:00:25,526 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-14 06:00:25,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:25,739 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 20 treesize of output 20 [2022-07-14 06:00:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:25,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:27,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-14 06:00:27,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|))) is different from false [2022-07-14 06:00:27,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:27,974 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 23 treesize of output 24 [2022-07-14 06:00:27,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:27,982 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 37 treesize of output 37 [2022-07-14 06:00:27,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:00:27,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 06:00:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:00:28,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055733391] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:28,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:28,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 115 [2022-07-14 06:00:28,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471343092] [2022-07-14 06:00:28,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:28,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-07-14 06:00:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:28,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-07-14 06:00:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=11887, Unknown=12, NotChecked=446, Total=13110 [2022-07-14 06:00:28,885 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:33,084 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-14 06:00:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-07-14 06:00:33,084 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 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 86 [2022-07-14 06:00:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:33,085 INFO L225 Difference]: With dead ends: 142 [2022-07-14 06:00:33,085 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:00:33,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 4793 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1638, Invalid=23164, Unknown=12, NotChecked=626, Total=25440 [2022-07-14 06:00:33,087 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1200 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:33,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 788 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 793 Invalid, 0 Unknown, 1200 Unchecked, 0.3s Time] [2022-07-14 06:00:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:00:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-07-14 06:00:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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-14 06:00:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-14 06:00:33,089 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2022-07-14 06:00:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:33,089 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-14 06:00:33,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-14 06:00:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 06:00:33,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:33,100 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:33,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:00:33,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:33,303 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -486951286, now seen corresponding path program 15 times [2022-07-14 06:00:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792126012] [2022-07-14 06:00:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792126012] [2022-07-14 06:00:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792126012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:34,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537334342] [2022-07-14 06:00:34,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:00:34,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:34,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:34,670 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-14 06:00:34,671 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-14 06:00:36,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-14 06:00:36,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:36,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 188 conjunts are in the unsatisfiable core [2022-07-14 06:00:36,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:36,518 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-14 06:00:37,062 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-14 06:00:37,241 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-14 06:00:37,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, 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-14 06:00:37,381 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-14 06:00:37,440 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-14 06:00:37,505 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-14 06:00:37,563 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-14 06:00:37,621 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-14 06:00:37,679 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-14 06:00:37,738 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-14 06:00:37,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:00:37,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:00:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:37,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:37,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:37,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:00:37,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1184) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:00:37,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1183) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1182) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:00:37,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1181) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1180) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1179) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1178) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:37,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:00:37,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:00:37,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:37,923 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 23 treesize of output 24 [2022-07-14 06:00:37,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:37,931 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 37 treesize of output 37 [2022-07-14 06:00:37,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:00:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 219 not checked. [2022-07-14 06:00:38,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537334342] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:38,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:38,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 39, 39] total 96 [2022-07-14 06:00:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888721482] [2022-07-14 06:00:38,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:38,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-14 06:00:38,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-14 06:00:38,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5347, Unknown=21, NotChecked=3486, Total=9120 [2022-07-14 06:00:38,346 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:40,962 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2022-07-14 06:00:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-14 06:00:40,963 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-14 06:00:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:40,963 INFO L225 Difference]: With dead ends: 148 [2022-07-14 06:00:40,963 INFO L226 Difference]: Without dead ends: 102 [2022-07-14 06:00:40,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 137 SyntacticMatches, 21 SemanticMatches, 116 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=398, Invalid=8977, Unknown=21, NotChecked=4410, Total=13806 [2022-07-14 06:00:40,965 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1735 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:40,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1068 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2380 Invalid, 0 Unknown, 1735 Unchecked, 1.0s Time] [2022-07-14 06:00:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-14 06:00:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-14 06:00:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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-14 06:00:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-07-14 06:00:40,967 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-07-14 06:00:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:40,967 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-07-14 06:00:40,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-07-14 06:00:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-14 06:00:40,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:40,969 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:40,989 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-14 06:00:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:41,175 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1113221351, now seen corresponding path program 16 times [2022-07-14 06:00:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:41,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112260102] [2022-07-14 06:00:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 153 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:41,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112260102] [2022-07-14 06:00:41,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112260102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:41,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27364380] [2022-07-14 06:00:41,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:00:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:41,754 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-14 06:00:41,784 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-14 06:00:41,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:00:41,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:41,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 192 conjunts are in the unsatisfiable core [2022-07-14 06:00:41,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:41,984 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:41,985 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-14 06:00:41,991 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-14 06:00:42,636 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 16 treesize of output 12 [2022-07-14 06:00:42,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:42,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:43,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:00:44,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:44,073 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 21 treesize of output 21 [2022-07-14 06:00:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 200 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:44,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:46,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-14 06:00:46,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-14 06:00:46,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:46,442 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 23 treesize of output 24 [2022-07-14 06:00:46,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:46,451 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 37 treesize of output 37 [2022-07-14 06:00:46,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:00:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-14 06:00:48,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27364380] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:48,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:48,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 40, 40] total 106 [2022-07-14 06:00:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638507318] [2022-07-14 06:00:48,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:48,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-07-14 06:00:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-07-14 06:00:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=9836, Unknown=12, NotChecked=414, Total=11342 [2022-07-14 06:00:48,499 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 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-14 06:00:52,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1))) (and (<= .cse0 .cse1) (<= |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11) (<= 11 .cse1) (or (= |c_ULTIMATE.start_cstrncpy_#t~mem5#1| 0) (not (= (+ (- 1) .cse1) (+ (- 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) (or (and (<= (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse1) (<= 0 .cse0)) (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1303) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0))) (<= 11 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))) is different from false [2022-07-14 06:00:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:52,828 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-14 06:00:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-14 06:00:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 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-14 06:00:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:52,829 INFO L225 Difference]: With dead ends: 107 [2022-07-14 06:00:52,829 INFO L226 Difference]: Without dead ends: 107 [2022-07-14 06:00:52,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 118 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2847, Invalid=16839, Unknown=66, NotChecked=840, Total=20592 [2022-07-14 06:00:52,831 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 266 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1166 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:52,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 870 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1724 Invalid, 0 Unknown, 1166 Unchecked, 0.9s Time] [2022-07-14 06:00:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-14 06:00:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-14 06:00:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-07-14 06:00:52,833 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 98 [2022-07-14 06:00:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:52,834 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-07-14 06:00:52,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 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-14 06:00:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-07-14 06:00:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 06:00:52,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:52,835 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:52,854 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-14 06:00:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:53,049 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash -36447463, now seen corresponding path program 17 times [2022-07-14 06:00:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:53,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228648891] [2022-07-14 06:00:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 303 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:53,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:53,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228648891] [2022-07-14 06:00:53,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228648891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:53,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776598802] [2022-07-14 06:00:53,705 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:00:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:53,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:53,706 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-14 06:00:53,709 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-14 06:00:56,219 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-14 06:00:56,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:56,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-14 06:00:56,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:56,248 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:56,249 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-14 06:00:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:57,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:57,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776598802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:57,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:57,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 72 [2022-07-14 06:00:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87660040] [2022-07-14 06:00:57,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:57,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-14 06:00:57,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:57,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-14 06:00:57,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=4233, Unknown=0, NotChecked=0, Total=5112 [2022-07-14 06:00:57,959 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:58,651 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2022-07-14 06:00:58,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:00:58,651 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 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 106 [2022-07-14 06:00:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:58,652 INFO L225 Difference]: With dead ends: 166 [2022-07-14 06:00:58,652 INFO L226 Difference]: Without dead ends: 114 [2022-07-14 06:00:58,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1509, Invalid=6147, Unknown=0, NotChecked=0, Total=7656 [2022-07-14 06:00:58,653 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:58,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 242 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:00:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-14 06:00:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-07-14 06:00:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-07-14 06:00:58,656 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-07-14 06:00:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:58,656 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-07-14 06:00:58,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-07-14 06:00:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 06:00:58,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:58,657 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:58,677 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-14 06:00:58,858 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,SelfDestructingSolverStorable35 [2022-07-14 06:00:58,858 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:00:58,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash 223537654, now seen corresponding path program 18 times [2022-07-14 06:00:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:58,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502166400] [2022-07-14 06:00:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502166400] [2022-07-14 06:01:00,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502166400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70372637] [2022-07-14 06:01:00,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:01:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:00,667 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-14 06:01:00,667 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-14 06:01:04,639 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-14 06:01:04,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:04,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 290 conjunts are in the unsatisfiable core [2022-07-14 06:01:04,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:04,693 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-14 06:01:05,627 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-14 06:01:05,846 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-14 06:01:06,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 06:01:06,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:01:06,360 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-14 06:01:06,523 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-14 06:01:06,703 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-14 06:01:06,872 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-14 06:01:07,042 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-14 06:01:07,234 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-14 06:01:07,406 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-14 06:01:07,595 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-14 06:01:07,768 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-14 06:01:07,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:01:07,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:07,937 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-14 06:01:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:07,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:07,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:01:07,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:01:07,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1543) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:01:07,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:07,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1542) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:07,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:07,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1541) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:07,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:07,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1540) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:07,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:08,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1539) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1538) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1537) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:08,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1536) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:08,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1535) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:01:08,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1534) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:01:08,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:01:08,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1533) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:01:08,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:08,107 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:08,107 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 23 treesize of output 24 [2022-07-14 06:01:08,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:08,113 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 37 treesize of output 37 [2022-07-14 06:01:08,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:01:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 311 not checked. [2022-07-14 06:01:09,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70372637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:09,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:09,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 139 [2022-07-14 06:01:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634905929] [2022-07-14 06:01:09,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:09,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-14 06:01:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:09,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-14 06:01:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=12535, Unknown=25, NotChecked=6200, Total=19182 [2022-07-14 06:01:09,236 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:12,757 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-07-14 06:01:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-14 06:01:12,757 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 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 110 [2022-07-14 06:01:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:12,758 INFO L225 Difference]: With dead ends: 172 [2022-07-14 06:01:12,758 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 06:01:12,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 170 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 6609 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=653, Invalid=20884, Unknown=25, NotChecked=7850, Total=29412 [2022-07-14 06:01:12,760 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2923 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:12,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1759 Invalid, 4928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1989 Invalid, 0 Unknown, 2923 Unchecked, 0.7s Time] [2022-07-14 06:01:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 06:01:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-07-14 06:01:12,762 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-14 06:01:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-14 06:01:12,762 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-07-14 06:01:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:12,763 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-14 06:01:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-14 06:01:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 06:01:12,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:12,764 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:12,798 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-14 06:01:12,964 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,SelfDestructingSolverStorable36 [2022-07-14 06:01:12,964 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:01:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 382026323, now seen corresponding path program 19 times [2022-07-14 06:01:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:12,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522284350] [2022-07-14 06:01:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 231 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:13,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522284350] [2022-07-14 06:01:13,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522284350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:13,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318464296] [2022-07-14 06:01:13,510 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:01:13,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:13,512 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-14 06:01:13,515 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-14 06:01:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:13,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-14 06:01:13,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:14,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:15,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:01:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:15,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318464296] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:15,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:15,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 65 [2022-07-14 06:01:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897438733] [2022-07-14 06:01:15,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:15,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-14 06:01:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-14 06:01:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3886, Unknown=0, NotChecked=0, Total=4290 [2022-07-14 06:01:15,105 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:17,192 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-07-14 06:01:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 06:01:17,192 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-14 06:01:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:17,193 INFO L225 Difference]: With dead ends: 121 [2022-07-14 06:01:17,193 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 06:01:17,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2253, Invalid=9303, Unknown=0, NotChecked=0, Total=11556 [2022-07-14 06:01:17,194 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 442 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:17,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 696 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 06:01:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 06:01:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-14 06:01:17,197 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-14 06:01:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-14 06:01:17,197 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-14 06:01:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:17,198 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-14 06:01:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-14 06:01:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 06:01:17,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:17,199 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:17,223 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-14 06:01:17,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-14 06:01:17,412 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:01:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -757002324, now seen corresponding path program 20 times [2022-07-14 06:01:17,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:17,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245633482] [2022-07-14 06:01:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245633482] [2022-07-14 06:01:19,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245633482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135459353] [2022-07-14 06:01:19,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:01:19,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:19,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:19,482 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-14 06:01:19,493 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-14 06:01:19,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:01:19,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:19,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 227 conjunts are in the unsatisfiable core [2022-07-14 06:01:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:19,731 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-14 06:01:20,451 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-14 06:01:20,743 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-14 06:01:20,934 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-14 06:01:21,119 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-14 06:01:21,309 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-14 06:01:21,504 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-14 06:01:21,724 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-14 06:01:21,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-14 06:01:22,174 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-14 06:01:22,415 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-14 06:01:22,645 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-14 06:01:22,899 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-14 06:01:23,147 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-14 06:01:23,376 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-14 06:01:23,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:23,615 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 20 treesize of output 20 [2022-07-14 06:01:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:23,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:27,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:27,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0))) is different from false [2022-07-14 06:01:27,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:27,452 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 23 treesize of output 24 [2022-07-14 06:01:27,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:27,459 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 37 treesize of output 37 [2022-07-14 06:01:27,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 06:01:27,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:01:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-14 06:01:29,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135459353] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:29,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 155 [2022-07-14 06:01:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868983425] [2022-07-14 06:01:29,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:29,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-07-14 06:01:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-07-14 06:01:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=21942, Unknown=14, NotChecked=606, Total=23870 [2022-07-14 06:01:29,118 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:40,805 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-14 06:01:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-07-14 06:01:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 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-14 06:01:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:40,807 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:01:40,807 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:01:40,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 9258 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2749, Invalid=42827, Unknown=14, NotChecked=850, Total=46440 [2022-07-14 06:01:40,810 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 174 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1188 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:40,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1566 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1448 Invalid, 0 Unknown, 1188 Unchecked, 0.5s Time] [2022-07-14 06:01:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:01:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-14 06:01:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-07-14 06:01:40,819 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2022-07-14 06:01:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:40,819 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-07-14 06:01:40,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-07-14 06:01:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 06:01:40,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:40,821 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:40,851 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-14 06:01:41,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:41,043 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:01:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1971076450, now seen corresponding path program 21 times [2022-07-14 06:01:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:41,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066312924] [2022-07-14 06:01:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:43,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066312924] [2022-07-14 06:01:43,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066312924] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:43,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404865456] [2022-07-14 06:01:43,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:01:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:43,251 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-14 06:01:43,252 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-14 06:01:51,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-14 06:01:51,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:51,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 328 conjunts are in the unsatisfiable core [2022-07-14 06:01:51,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:51,518 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-14 06:01:52,633 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-14 06:01:52,884 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-14 06:01:53,057 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-14 06:01:53,237 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-14 06:01:53,424 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-14 06:01:53,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:01:53,884 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-14 06:01:54,111 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-14 06:01:54,319 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-14 06:01:54,517 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-14 06:01:54,703 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-14 06:01:54,889 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-14 06:01:55,090 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-14 06:01:55,290 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-14 06:01:55,482 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-14 06:01:55,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:01:55,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:55,659 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-14 06:01:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:55,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:55,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:01:55,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:01:55,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1947) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:01:55,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1946) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1945) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1944) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1943) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1942) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1941 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1941) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1940) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:55,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1939) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:01:55,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1938) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:01:55,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:01:55,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1937) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:01:55,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1936) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1935) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:01:55,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:55,903 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 37 treesize of output 37 [2022-07-14 06:01:55,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:01:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 419 not checked. [2022-07-14 06:01:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404865456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:57,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:57,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 51, 51] total 159 [2022-07-14 06:01:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577965739] [2022-07-14 06:01:57,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:57,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-07-14 06:01:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:57,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-07-14 06:01:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=16375, Unknown=29, NotChecked=8236, Total=25122 [2022-07-14 06:01:57,193 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:01,936 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2022-07-14 06:02:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-14 06:02:01,937 INFO L78 Accepts]: Start accepts. Automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 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 126 [2022-07-14 06:02:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:01,937 INFO L225 Difference]: With dead ends: 196 [2022-07-14 06:02:01,938 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:02:01,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 158 SyntacticMatches, 15 SemanticMatches, 199 ConstructedPredicates, 29 IntricatePredicates, 13 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=775, Invalid=28724, Unknown=29, NotChecked=10672, Total=40200 [2022-07-14 06:02:01,940 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 5308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2894 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:01,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 2161 Invalid, 5308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2397 Invalid, 0 Unknown, 2894 Unchecked, 0.9s Time] [2022-07-14 06:02:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:02:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-07-14 06:02:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-07-14 06:02:01,955 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-07-14 06:02:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:01,956 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-07-14 06:02:01,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-07-14 06:02:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-14 06:02:01,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:01,958 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:02,006 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-14 06:02:02,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-14 06:02:02,175 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:02:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 217332671, now seen corresponding path program 22 times [2022-07-14 06:02:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:02,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770189407] [2022-07-14 06:02:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 325 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:03,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770189407] [2022-07-14 06:02:03,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770189407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:03,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783259595] [2022-07-14 06:02:03,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:02:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:03,020 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-14 06:02:03,022 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-14 06:02:03,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:02:03,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:02:03,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 248 conjunts are in the unsatisfiable core [2022-07-14 06:02:03,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:02:03,304 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-14 06:02:03,309 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-14 06:02:04,207 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 16 treesize of output 12 [2022-07-14 06:02:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:04,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:04,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:04,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:05,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:05,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:05,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:05,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:05,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 18 treesize of output 20 [2022-07-14 06:02:05,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:05,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 18 treesize of output 20 [2022-07-14 06:02:06,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:06,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:06,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:02:06,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:06,619 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 21 treesize of output 21 [2022-07-14 06:02:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 392 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:06,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:02:10,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) 0) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)))) is different from false [2022-07-14 06:02:10,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) is different from false [2022-07-14 06:02:10,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:10,137 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 23 treesize of output 24 [2022-07-14 06:02:10,143 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:10,143 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 37 treesize of output 37 [2022-07-14 06:02:10,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:02:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-14 06:02:13,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783259595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:02:13,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:02:13,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 52, 52] total 138 [2022-07-14 06:02:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352480053] [2022-07-14 06:02:13,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:02:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-14 06:02:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:02:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-14 06:02:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1813, Invalid=16811, Unknown=16, NotChecked=542, Total=19182 [2022-07-14 06:02:13,212 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:19,560 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2022-07-14 06:02:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-07-14 06:02:19,560 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 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 130 [2022-07-14 06:02:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:19,561 INFO L225 Difference]: With dead ends: 139 [2022-07-14 06:02:19,561 INFO L226 Difference]: Without dead ends: 139 [2022-07-14 06:02:19,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 164 SyntacticMatches, 9 SemanticMatches, 189 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6758 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=5196, Invalid=30248, Unknown=96, NotChecked=750, Total=36290 [2022-07-14 06:02:19,563 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 230 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1804 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:19,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1057 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1579 Invalid, 0 Unknown, 1804 Unchecked, 0.7s Time] [2022-07-14 06:02:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-14 06:02:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-14 06:02:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-07-14 06:02:19,566 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 130 [2022-07-14 06:02:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:19,567 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-07-14 06:02:19,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-07-14 06:02:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 06:02:19,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:19,568 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:19,599 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-14 06:02:19,795 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,SelfDestructingSolverStorable40 [2022-07-14 06:02:19,795 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:02:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1547261425, now seen corresponding path program 23 times [2022-07-14 06:02:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032111846] [2022-07-14 06:02:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 531 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:20,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032111846] [2022-07-14 06:02:20,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032111846] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:20,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639221998] [2022-07-14 06:02:20,486 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:02:20,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:20,487 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-14 06:02:20,488 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-14 06:02:29,151 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-14 06:02:29,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:02:29,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-14 06:02:29,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:02:29,191 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:02:29,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, 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-14 06:02:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:30,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:02:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639221998] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:02:31,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:02:31,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 91 [2022-07-14 06:02:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340716508] [2022-07-14 06:02:31,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:02:31,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-14 06:02:31,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:02:31,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-14 06:02:31,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=6882, Unknown=0, NotChecked=0, Total=8190 [2022-07-14 06:02:31,872 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:33,507 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-14 06:02:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 06:02:33,507 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 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 138 [2022-07-14 06:02:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:33,508 INFO L225 Difference]: With dead ends: 214 [2022-07-14 06:02:33,508 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 06:02:33,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2802, Invalid=12948, Unknown=0, NotChecked=0, Total=15750 [2022-07-14 06:02:33,511 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 146 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:33,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 267 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:02:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 06:02:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-07-14 06:02:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-07-14 06:02:33,514 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2022-07-14 06:02:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:33,514 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-07-14 06:02:33,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:02:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-07-14 06:02:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-14 06:02:33,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:33,516 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:33,542 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-14 06:02:33,723 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,SelfDestructingSolverStorable41 [2022-07-14 06:02:33,724 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:02:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 524136654, now seen corresponding path program 24 times [2022-07-14 06:02:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:33,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522980798] [2022-07-14 06:02:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522980798] [2022-07-14 06:02:36,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522980798] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781977439] [2022-07-14 06:02:36,398 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:02:36,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:36,400 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-14 06:02:36,401 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-14 06:03:22,440 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-14 06:03:22,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:03:22,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 284 conjunts are in the unsatisfiable core [2022-07-14 06:03:22,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:03:22,524 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-14 06:03:23,664 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-14 06:03:23,943 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-14 06:03:24,050 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-14 06:03:24,130 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-14 06:03:24,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 16 treesize of output 18 [2022-07-14 06:03:24,323 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-14 06:03:24,407 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-14 06:03:24,493 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-14 06:03:24,583 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-14 06:03:24,671 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-14 06:03:24,763 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-14 06:03:24,841 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-14 06:03:24,920 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-14 06:03:25,001 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-14 06:03:25,081 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-14 06:03:25,162 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-14 06:03:25,251 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-14 06:03:25,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:03:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:03:25,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:03:25,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:03:25,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:03:25,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2411) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:03:25,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:03:25,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2410 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2410) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2409) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2408) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2407) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2406) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2405) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2404) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2403) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:03:25,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2402) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:03:25,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:03:25,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2401) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)))) is different from false [2022-07-14 06:03:25,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:03:25,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2400 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2400) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2399) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2398) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:03:25,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2397) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:03:25,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:03:25,532 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 23 treesize of output 24 [2022-07-14 06:03:25,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:03:25,537 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 37 treesize of output 37 [2022-07-14 06:03:25,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:03:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 543 not checked. [2022-07-14 06:03:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781977439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:03:26,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:03:26,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 57, 57] total 146 [2022-07-14 06:03:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533889857] [2022-07-14 06:03:26,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:03:26,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2022-07-14 06:03:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:03:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2022-07-14 06:03:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=12349, Unknown=33, NotChecked=8382, Total=21170 [2022-07-14 06:03:26,106 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)