./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:34:41,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:34:41,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:34:41,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:34:41,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:34:41,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:34:41,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:34:41,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:34:41,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:34:41,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:34:41,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:34:41,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:34:41,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:34:41,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:34:41,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:34:41,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:34:41,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:34:41,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:34:41,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:34:41,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:34:41,267 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:34:41,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:34:41,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:34:41,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:34:41,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:34:41,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:34:41,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:34:41,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:34:41,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:34:41,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:34:41,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:34:41,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:34:41,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:34:41,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:34:41,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:34:41,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:34:41,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:34:41,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:34:41,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:34:41,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:34:41,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:34:41,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:34:41,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:34:41,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:34:41,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:34:41,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:34:41,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:34:41,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:34:41,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:34:41,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:34:41,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:34:41,314 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:34:41,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:34:41,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:34:41,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:34:41,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:34:41,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:34:41,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:34:41,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:34:41,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:34:41,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:34:41,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:34:41,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:34:41,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:34:41,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:34:41,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:34:41,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:34:41,320 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2022-07-23 05:34:41,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:34:41,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:34:41,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:34:41,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:34:41,561 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:34:41,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-23 05:34:41,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f15f685/431f9a3d378d4b55a7dedbc81422a98d/FLAGfc759b858 [2022-07-23 05:34:42,092 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:34:42,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-23 05:34:42,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f15f685/431f9a3d378d4b55a7dedbc81422a98d/FLAGfc759b858 [2022-07-23 05:34:42,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f15f685/431f9a3d378d4b55a7dedbc81422a98d [2022-07-23 05:34:42,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:34:42,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:34:42,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:34:42,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:34:42,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:34:42,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:34:42" (1/1) ... [2022-07-23 05:34:42,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f45185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:42, skipping insertion in model container [2022-07-23 05:34:42,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:34:42" (1/1) ... [2022-07-23 05:34:42,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:34:42,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:34:42,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:34:42,951 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:34:42,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:34:43,008 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:34:43,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43 WrapperNode [2022-07-23 05:34:43,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:34:43,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:34:43,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:34:43,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:34:43,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,055 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-07-23 05:34:43,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:34:43,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:34:43,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:34:43,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:34:43,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:34:43,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:34:43,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:34:43,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:34:43,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (1/1) ... [2022-07-23 05:34:43,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:34:43,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:43,141 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-23 05:34:43,145 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-23 05:34:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:34:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:34:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:34:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:34:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:34:43,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:34:43,249 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:34:43,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:34:43,350 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:34:43,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:34:43,354 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 05:34:43,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:34:43 BoogieIcfgContainer [2022-07-23 05:34:43,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:34:43,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:34:43,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:34:43,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:34:43,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:34:42" (1/3) ... [2022-07-23 05:34:43,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a28950d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:34:43, skipping insertion in model container [2022-07-23 05:34:43,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:43" (2/3) ... [2022-07-23 05:34:43,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a28950d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:34:43, skipping insertion in model container [2022-07-23 05:34:43,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:34:43" (3/3) ... [2022-07-23 05:34:43,360 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2022-07-23 05:34:43,368 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:34:43,368 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-23 05:34:43,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:34:43,398 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@280ad857, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68651d78 [2022-07-23 05:34:43,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-23 05:34:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 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-23 05:34:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:34:43,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:43,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:34:43,405 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-23 05:34:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:43,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788257456] [2022-07-23 05:34:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:43,720 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-23 05:34:43,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:43,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788257456] [2022-07-23 05:34:43,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788257456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:43,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:43,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039701456] [2022-07-23 05:34:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:43,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:43,751 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:43,828 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-23 05:34:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 05:34:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:43,835 INFO L225 Difference]: With dead ends: 34 [2022-07-23 05:34:43,835 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 05:34:43,837 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-23 05:34:43,842 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:43,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 05:34:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-23 05:34:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 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-23 05:34:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:34:43,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-23 05:34:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:43,872 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:34:43,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:34:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:34:43,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:43,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:34:43,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:34:43,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:43,877 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-23 05:34:43,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:43,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063833172] [2022-07-23 05:34:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:43,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:43,912 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-23 05:34:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:43,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063833172] [2022-07-23 05:34:43,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063833172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:43,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:43,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:34:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429147709] [2022-07-23 05:34:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:43,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:34:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:34:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:34:43,916 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:43,934 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-23 05:34:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:34:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 05:34:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:43,937 INFO L225 Difference]: With dead ends: 29 [2022-07-23 05:34:43,937 INFO L226 Difference]: Without dead ends: 28 [2022-07-23 05:34:43,940 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-23 05:34:43,941 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:43,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-23 05:34:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-23 05:34:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-23 05:34:43,947 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-23 05:34:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:43,948 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-23 05:34:43,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-23 05:34:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:43,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:43,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:43,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:34:43,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-23 05:34:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:43,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511463282] [2022-07-23 05:34:43,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,011 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-23 05:34:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511463282] [2022-07-23 05:34:44,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511463282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:34:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24422123] [2022-07-23 05:34:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:34:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:34:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:34:44,014 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. 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-23 05:34:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,033 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-23 05:34:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:34:44,033 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-23 05:34:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,034 INFO L225 Difference]: With dead ends: 25 [2022-07-23 05:34:44,034 INFO L226 Difference]: Without dead ends: 25 [2022-07-23 05:34:44,034 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-23 05:34:44,035 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-23 05:34:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 05:34:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-23 05:34:44,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-23 05:34:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,040 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-23 05:34:44,040 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-23 05:34:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-23 05:34:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:44,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:34:44,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-23 05:34:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339280951] [2022-07-23 05:34:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,111 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-23 05:34:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339280951] [2022-07-23 05:34:44,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339280951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:34:44,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341768932] [2022-07-23 05:34:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:44,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:44,115 INFO L87 Difference]: Start difference. First operand 25 states and 28 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-23 05:34:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,159 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-23 05:34:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:44,159 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-23 05:34:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,161 INFO L225 Difference]: With dead ends: 24 [2022-07-23 05:34:44,161 INFO L226 Difference]: Without dead ends: 24 [2022-07-23 05:34:44,161 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-23 05:34:44,166 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-23 05:34:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-23 05:34:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-23 05:34:44,175 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-23 05:34:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,176 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-23 05:34:44,176 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-23 05:34:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-23 05:34:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:44,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:34:44,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-23 05:34:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487245600] [2022-07-23 05:34:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,238 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-23 05:34:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487245600] [2022-07-23 05:34:44,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487245600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800463919] [2022-07-23 05:34:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:44,244 INFO L87 Difference]: Start difference. First operand 24 states and 27 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-23 05:34:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,262 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-23 05:34:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:44,263 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-23 05:34:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,263 INFO L225 Difference]: With dead ends: 40 [2022-07-23 05:34:44,264 INFO L226 Difference]: Without dead ends: 40 [2022-07-23 05:34:44,264 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-23 05:34:44,265 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 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-23 05:34:44,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-23 05:34:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-23 05:34:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-23 05:34:44,269 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-23 05:34:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,269 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-23 05:34:44,269 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-23 05:34:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-23 05:34:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:44,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:34:44,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-23 05:34:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973560180] [2022-07-23 05:34:44,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:44,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973560180] [2022-07-23 05:34:44,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973560180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:34:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196747858] [2022-07-23 05:34:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:44,316 INFO L87 Difference]: Start difference. First operand 26 states and 29 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-23 05:34:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,353 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-23 05:34:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:44,354 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-23 05:34:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,355 INFO L225 Difference]: With dead ends: 44 [2022-07-23 05:34:44,355 INFO L226 Difference]: Without dead ends: 44 [2022-07-23 05:34:44,355 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-23 05:34:44,356 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-23 05:34:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-23 05:34:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 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-23 05:34:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:34:44,360 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-23 05:34:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,360 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:34:44,360 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-23 05:34:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:34:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:34:44,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:34:44,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2022-07-23 05:34:44,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429822003] [2022-07-23 05:34:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,453 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-23 05:34:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429822003] [2022-07-23 05:34:44,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429822003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:34:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975786710] [2022-07-23 05:34:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:34:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:34:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:34:44,456 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-23 05:34:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,524 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-07-23 05:34:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:34:44,525 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-23 05:34:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,526 INFO L225 Difference]: With dead ends: 35 [2022-07-23 05:34:44,526 INFO L226 Difference]: Without dead ends: 35 [2022-07-23 05:34:44,526 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-23 05:34:44,527 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-23 05:34:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-07-23 05:34:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) 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-23 05:34:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-23 05:34:44,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2022-07-23 05:34:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,531 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-23 05:34:44,531 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-23 05:34:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-23 05:34:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:34:44,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:34:44,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2022-07-23 05:34:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600613562] [2022-07-23 05:34:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,569 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-23 05:34:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600613562] [2022-07-23 05:34:44,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600613562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235987759] [2022-07-23 05:34:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:34:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:34:44,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:34:44,572 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-23 05:34:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,609 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-23 05:34:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:34:44,610 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-23 05:34:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,611 INFO L225 Difference]: With dead ends: 29 [2022-07-23 05:34:44,611 INFO L226 Difference]: Without dead ends: 29 [2022-07-23 05:34:44,611 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-23 05:34:44,612 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-23 05:34:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-23 05:34:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-23 05:34:44,615 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2022-07-23 05:34:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,616 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-23 05:34:44,616 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-23 05:34:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-23 05:34:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:44,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:34:44,617 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2022-07-23 05:34:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087559523] [2022-07-23 05:34:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,709 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-23 05:34:44,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087559523] [2022-07-23 05:34:44,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087559523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:34:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539414577] [2022-07-23 05:34:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:34:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:34:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:34:44,711 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-23 05:34:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,753 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-23 05:34:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:34:44,754 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-23 05:34:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,754 INFO L225 Difference]: With dead ends: 28 [2022-07-23 05:34:44,754 INFO L226 Difference]: Without dead ends: 28 [2022-07-23 05:34:44,755 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-23 05:34:44,755 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-23 05:34:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-23 05:34:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 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-23 05:34:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:34:44,758 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2022-07-23 05:34:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,759 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:34:44,759 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-23 05:34:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:34:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:44,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:34:44,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2022-07-23 05:34:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291036081] [2022-07-23 05:34:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,818 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-23 05:34:44,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291036081] [2022-07-23 05:34:44,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291036081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:34:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588765226] [2022-07-23 05:34:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:34:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:34:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:34:44,820 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-23 05:34:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,862 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-23 05:34:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:34:44,863 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-23 05:34:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,863 INFO L225 Difference]: With dead ends: 30 [2022-07-23 05:34:44,863 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 05:34:44,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:34:44,864 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 05:34:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-23 05:34:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-23 05:34:44,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-07-23 05:34:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,867 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-23 05:34:44,867 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-23 05:34:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-23 05:34:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:44,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,867 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:34:44,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-23 05:34:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007357100] [2022-07-23 05:34:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:34:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007357100] [2022-07-23 05:34:44,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007357100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:44,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:44,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615578315] [2022-07-23 05:34:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:44,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:44,914 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 05:34:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:44,936 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-23 05:34:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 05:34:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:44,938 INFO L225 Difference]: With dead ends: 49 [2022-07-23 05:34:44,938 INFO L226 Difference]: Without dead ends: 49 [2022-07-23 05:34:44,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:34:44,939 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:44,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-23 05:34:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-07-23 05:34:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) 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-23 05:34:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-23 05:34:44,945 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2022-07-23 05:34:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:44,945 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-23 05:34:44,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 05:34:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-23 05:34:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:44,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:44,946 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:44,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:34:44,947 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-23 05:34:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:44,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175628444] [2022-07-23 05:34:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:45,007 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-23 05:34:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:45,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175628444] [2022-07-23 05:34:45,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175628444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:45,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947536065] [2022-07-23 05:34:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:45,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:45,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:45,010 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-23 05:34:45,035 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-23 05:34:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:45,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:34:45,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:45,140 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:34:45,141 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-23 05:34:45,211 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-23 05:34:45,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:45,381 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-23 05:34:45,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947536065] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:45,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-23 05:34:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639006573] [2022-07-23 05:34:45,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:45,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:34:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:45,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:34:45,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:34:45,388 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-23 05:34:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:45,507 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-23 05:34:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:34:45,508 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-23 05:34:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:45,509 INFO L225 Difference]: With dead ends: 62 [2022-07-23 05:34:45,509 INFO L226 Difference]: Without dead ends: 62 [2022-07-23 05:34:45,509 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-23 05:34:45,509 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:45,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-23 05:34:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2022-07-23 05:34:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-23 05:34:45,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2022-07-23 05:34:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:45,515 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 05:34:45,515 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-23 05:34:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-23 05:34:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:34:45,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:45,516 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:45,540 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-23 05:34:45,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-23 05:34:45,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2022-07-23 05:34:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:45,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430311681] [2022-07-23 05:34:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:45,818 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-23 05:34:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:45,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430311681] [2022-07-23 05:34:45,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430311681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:45,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:45,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:34:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009916019] [2022-07-23 05:34:45,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:45,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:34:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:45,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:34:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:34:45,820 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-23 05:34:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:45,878 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-07-23 05:34:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:34:45,879 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-23 05:34:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:45,879 INFO L225 Difference]: With dead ends: 39 [2022-07-23 05:34:45,879 INFO L226 Difference]: Without dead ends: 39 [2022-07-23 05:34:45,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:34:45,880 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:45,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-23 05:34:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-23 05:34:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 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-23 05:34:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-23 05:34:45,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2022-07-23 05:34:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:45,882 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-23 05:34:45,882 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-23 05:34:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-23 05:34:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:34:45,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:45,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:45,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:34:45,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2022-07-23 05:34:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:45,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337434446] [2022-07-23 05:34:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:45,940 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-23 05:34:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:45,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337434446] [2022-07-23 05:34:45,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337434446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:45,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:45,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:34:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130699129] [2022-07-23 05:34:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:45,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:34:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:45,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:34:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:34:45,942 INFO L87 Difference]: Start difference. First operand 35 states and 39 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-23 05:34:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:46,018 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-07-23 05:34:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:34:46,019 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-23 05:34:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:46,019 INFO L225 Difference]: With dead ends: 53 [2022-07-23 05:34:46,019 INFO L226 Difference]: Without dead ends: 53 [2022-07-23 05:34:46,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-23 05:34:46,020 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:46,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-23 05:34:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-23 05:34:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-23 05:34:46,022 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2022-07-23 05:34:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:46,022 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-23 05:34:46,023 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-23 05:34:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-23 05:34:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:34:46,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:46,023 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:46,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:34:46,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2022-07-23 05:34:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:46,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923827324] [2022-07-23 05:34:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:46,093 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-23 05:34:46,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:46,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923827324] [2022-07-23 05:34:46,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923827324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:46,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:46,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:34:46,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473081622] [2022-07-23 05:34:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:46,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:34:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:46,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:34:46,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:34:46,096 INFO L87 Difference]: Start difference. First operand 33 states and 37 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-23 05:34:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:46,303 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-07-23 05:34:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:34:46,304 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-23 05:34:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:46,304 INFO L225 Difference]: With dead ends: 47 [2022-07-23 05:34:46,304 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 05:34:46,304 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-23 05:34:46,305 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:46,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 05:34:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-23 05:34:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 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-23 05:34:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-23 05:34:46,307 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2022-07-23 05:34:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:46,307 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-23 05:34:46,307 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-23 05:34:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-23 05:34:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:34:46,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:46,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:34:46,308 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2022-07-23 05:34:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:46,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559645389] [2022-07-23 05:34:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:46,362 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-23 05:34:46,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559645389] [2022-07-23 05:34:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559645389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:46,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:46,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:34:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896928248] [2022-07-23 05:34:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:46,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:46,364 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-23 05:34:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:46,375 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-23 05:34:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-23 05:34:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:46,376 INFO L225 Difference]: With dead ends: 33 [2022-07-23 05:34:46,376 INFO L226 Difference]: Without dead ends: 21 [2022-07-23 05:34:46,376 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-23 05:34:46,377 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:46,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-23 05:34:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-23 05:34:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-23 05:34:46,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-07-23 05:34:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:46,380 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-23 05:34:46,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-23 05:34:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-23 05:34:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:34:46,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:46,381 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:46,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:34:46,382 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2022-07-23 05:34:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:46,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475317956] [2022-07-23 05:34:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:46,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:46,520 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-23 05:34:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:46,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475317956] [2022-07-23 05:34:46,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475317956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:46,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084332222] [2022-07-23 05:34:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:46,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:46,523 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-23 05:34:46,551 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-23 05:34:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:46,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 05:34:46,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:46,697 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-23 05:34:46,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:46,842 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-23 05:34:46,862 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-23 05:34:46,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084332222] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:46,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:46,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-07-23 05:34:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593819537] [2022-07-23 05:34:46,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:46,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 05:34:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:46,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 05:34:46,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-23 05:34:46,864 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 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-23 05:34:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:47,071 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-23 05:34:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:34:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 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-23 05:34:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:47,072 INFO L225 Difference]: With dead ends: 30 [2022-07-23 05:34:47,072 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 05:34:47,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2022-07-23 05:34:47,073 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:47,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 70 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 05:34:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-23 05:34:47,074 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-23 05:34:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-23 05:34:47,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-23 05:34:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:47,075 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-23 05:34:47,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 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-23 05:34:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-23 05:34:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:34:47,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:47,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:47,118 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-23 05:34:47,276 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,SelfDestructingSolverStorable16 [2022-07-23 05:34:47,276 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2022-07-23 05:34:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:47,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402516345] [2022-07-23 05:34:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402516345] [2022-07-23 05:34:47,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402516345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339597559] [2022-07-23 05:34:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:47,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:47,388 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-23 05:34:47,389 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-23 05:34:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:47,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-23 05:34:47,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:47,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:47,466 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-23 05:34:47,470 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-23 05:34:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:47,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339597559] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:47,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:47,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-07-23 05:34:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29307267] [2022-07-23 05:34:47,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:47,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 05:34:47,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 05:34:47,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-23 05:34:47,744 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-23 05:34:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:47,982 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-23 05:34:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:34:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-23 05:34:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:47,983 INFO L225 Difference]: With dead ends: 29 [2022-07-23 05:34:47,983 INFO L226 Difference]: Without dead ends: 29 [2022-07-23 05:34:47,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-07-23 05:34:47,984 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:47,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-23 05:34:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-23 05:34:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-23 05:34:47,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-07-23 05:34:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:47,986 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 05:34:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-23 05:34:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-23 05:34:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:34:47,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:47,986 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:48,007 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-23 05:34:48,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 05:34:48,187 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2022-07-23 05:34:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410718533] [2022-07-23 05:34:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:48,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-23 05:34:48,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410718533] [2022-07-23 05:34:48,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410718533] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228092395] [2022-07-23 05:34:48,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:34:48,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:48,484 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-23 05:34:48,485 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-23 05:34:48,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:34:48,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:34:48,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:34:48,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:48,576 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-23 05:34:48,639 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-23 05:34:48,818 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-23 05:34:48,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:48,949 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-23 05:34:49,064 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-23 05:34:49,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:49,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:34:49,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0))) is different from false [2022-07-23 05:34:49,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:49,319 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-23 05:34:49,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:49,341 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-23 05:34:49,347 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-23 05:34:49,351 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-23 05:34:49,449 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-23 05:34:49,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228092395] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:49,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:49,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-23 05:34:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881655044] [2022-07-23 05:34:49,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:49,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 05:34:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 05:34:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=950, Unknown=2, NotChecked=126, Total=1190 [2022-07-23 05:34:49,452 INFO L87 Difference]: Start difference. First operand 25 states and 26 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-23 05:34:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:49,881 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-23 05:34:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 05:34:49,881 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-23 05:34:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:49,882 INFO L225 Difference]: With dead ends: 48 [2022-07-23 05:34:49,882 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 05:34:49,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1929, Unknown=2, NotChecked=182, Total=2352 [2022-07-23 05:34:49,883 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:49,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-07-23 05:34:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 05:34:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-23 05:34:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-23 05:34:49,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2022-07-23 05:34:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:49,885 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-23 05:34:49,886 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-23 05:34:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-23 05:34:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:34:49,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:49,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:49,925 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-23 05:34:50,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:50,096 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2022-07-23 05:34:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:50,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719737740] [2022-07-23 05:34:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719737740] [2022-07-23 05:34:50,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719737740] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751284941] [2022-07-23 05:34:50,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:34:50,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:50,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:50,258 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-23 05:34:50,259 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-23 05:34:50,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:34:50,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:34:50,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-23 05:34:50,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:50,352 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-23 05:34:50,355 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-23 05:34:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:50,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:50,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751284941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:50,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:50,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-07-23 05:34:50,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625165700] [2022-07-23 05:34:50,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:50,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 05:34:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 05:34:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-07-23 05:34:50,803 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:51,139 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-23 05:34:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:34:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 05:34:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:51,146 INFO L225 Difference]: With dead ends: 34 [2022-07-23 05:34:51,147 INFO L226 Difference]: Without dead ends: 34 [2022-07-23 05:34:51,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:34:51,147 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:51,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-23 05:34:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-23 05:34:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-23 05:34:51,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2022-07-23 05:34:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:51,149 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-23 05:34:51,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-23 05:34:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 05:34:51,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:51,149 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:51,174 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-23 05:34:51,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:51,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2022-07-23 05:34:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:51,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766721410] [2022-07-23 05:34:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:51,623 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-23 05:34:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766721410] [2022-07-23 05:34:51,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766721410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098161836] [2022-07-23 05:34:51,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:34:51,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:51,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:51,625 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-23 05:34:51,626 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-23 05:34:51,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:34:51,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:34:51,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-23 05:34:51,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:51,728 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-23 05:34:51,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:34:52,017 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-23 05:34:52,098 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-23 05:34:52,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:34:52,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:52,197 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-23 05:34:52,201 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-23 05:34:52,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:52,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2022-07-23 05:34:52,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:34:52,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_260) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:34:52,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:34:52,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:34:52,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:52,273 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-23 05:34:52,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:52,280 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-23 05:34:52,290 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-23 05:34:52,486 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-23 05:34:52,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098161836] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:52,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:52,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2022-07-23 05:34:52,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456583822] [2022-07-23 05:34:52,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:52,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-23 05:34:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-23 05:34:52,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1015, Unknown=5, NotChecked=340, Total=1482 [2022-07-23 05:34:52,489 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:52,753 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-23 05:34:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:34:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-23 05:34:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:52,754 INFO L225 Difference]: With dead ends: 54 [2022-07-23 05:34:52,754 INFO L226 Difference]: Without dead ends: 40 [2022-07-23 05:34:52,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1553, Unknown=5, NotChecked=420, Total=2162 [2022-07-23 05:34:52,755 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:52,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-07-23 05:34:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-23 05:34:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-23 05:34:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-07-23 05:34:52,757 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2022-07-23 05:34:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:52,757 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-07-23 05:34:52,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-07-23 05:34:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:34:52,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:52,758 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:52,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-23 05:34:52,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:52,966 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2022-07-23 05:34:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:52,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131747501] [2022-07-23 05:34:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:53,107 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-23 05:34:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131747501] [2022-07-23 05:34:53,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131747501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783090907] [2022-07-23 05:34:53,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:34:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:53,110 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-23 05:34:53,111 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-23 05:34:53,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:34:53,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:34:53,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-23 05:34:53,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:53,188 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-23 05:34:53,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-23 05:34:53,351 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-23 05:34:53,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:34:53,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:34:53,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:53,667 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 22 treesize of output 22 [2022-07-23 05:34:53,771 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-23 05:34:53,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:54,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0))) is different from false [2022-07-23 05:34:54,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2022-07-23 05:34:54,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:54,205 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-23 05:34:54,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:54,213 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-23 05:34:54,217 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-23 05:34:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 05:34:54,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783090907] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:54,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:54,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2022-07-23 05:34:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700110558] [2022-07-23 05:34:54,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:54,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-23 05:34:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 05:34:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1456, Unknown=4, NotChecked=158, Total=1806 [2022-07-23 05:34:54,756 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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-23 05:34:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:55,314 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-23 05:34:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:34:55,316 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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-23 05:34:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:55,317 INFO L225 Difference]: With dead ends: 43 [2022-07-23 05:34:55,317 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 05:34:55,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=379, Invalid=2595, Unknown=4, NotChecked=214, Total=3192 [2022-07-23 05:34:55,318 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:55,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 218 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 157 Unchecked, 0.1s Time] [2022-07-23 05:34:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 05:34:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-07-23 05:34:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-07-23 05:34:55,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2022-07-23 05:34:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:55,320 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-07-23 05:34:55,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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-23 05:34:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-07-23 05:34:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:34:55,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:55,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:55,343 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-23 05:34:55,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:55,533 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2022-07-23 05:34:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:55,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062896416] [2022-07-23 05:34:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:55,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:55,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062896416] [2022-07-23 05:34:55,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062896416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:55,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317170934] [2022-07-23 05:34:55,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:34:55,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:55,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:55,700 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-23 05:34:55,700 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-23 05:34:55,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:34:55,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:34:55,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-23 05:34:55,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:55,815 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:34:55,816 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-23 05:34:55,824 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-23 05:34:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:34:56,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:34:56,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317170934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:56,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:56,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-07-23 05:34:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144511047] [2022-07-23 05:34:56,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 05:34:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 05:34:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-07-23 05:34:56,622 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:57,685 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-07-23 05:34:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:34:57,685 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 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 35 [2022-07-23 05:34:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:57,685 INFO L225 Difference]: With dead ends: 56 [2022-07-23 05:34:57,685 INFO L226 Difference]: Without dead ends: 56 [2022-07-23 05:34:57,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=437, Invalid=2113, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 05:34:57,686 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:57,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 125 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 367 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2022-07-23 05:34:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-23 05:34:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-07-23 05:34:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-23 05:34:57,688 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 35 [2022-07-23 05:34:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:57,688 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-23 05:34:57,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-23 05:34:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:34:57,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:57,689 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:57,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-23 05:34:57,889 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,SelfDestructingSolverStorable22 [2022-07-23 05:34:57,890 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:34:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2022-07-23 05:34:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:57,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42609240] [2022-07-23 05:34:57,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:58,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42609240] [2022-07-23 05:34:58,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42609240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:58,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796898960] [2022-07-23 05:34:58,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:34:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:58,260 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-23 05:34:58,261 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-23 05:34:58,347 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-23 05:34:58,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:34:58,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-23 05:34:58,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:58,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-23 05:34:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:58,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-23 05:34:58,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:58,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-23 05:34:58,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:58,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-23 05:34:58,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:34:58,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:34:58,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-07-23 05:34:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:58,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:59,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)))) is different from false [2022-07-23 05:35:42,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-23 05:35:45,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-23 05:35:45,046 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 776 treesize of output 764 [2022-07-23 05:35:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-23 05:35:46,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796898960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:46,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:46,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 49 [2022-07-23 05:35:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316724410] [2022-07-23 05:35:46,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:46,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-23 05:35:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-23 05:35:46,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1924, Unknown=16, NotChecked=270, Total=2352 [2022-07-23 05:35:46,516 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:48,952 WARN L833 $PredicateComparison]: unable to prove that (and (< 3 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~length2~0#1| 4) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (< 3 |ULTIMATE.start_main_~length2~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0))) (<= 0 |c_ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:50,966 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< 3 |ULTIMATE.start_main_~length2~0#1|))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) 3) 0) (<= |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) is different from false [2022-07-23 05:35:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:52,732 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-23 05:35:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 05:35:52,732 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-23 05:35:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:52,734 INFO L225 Difference]: With dead ends: 78 [2022-07-23 05:35:52,734 INFO L226 Difference]: Without dead ends: 60 [2022-07-23 05:35:52,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=249, Invalid=3293, Unknown=18, NotChecked=600, Total=4160 [2022-07-23 05:35:52,735 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:52,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 352 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 397 Invalid, 0 Unknown, 282 Unchecked, 0.2s Time] [2022-07-23 05:35:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-23 05:35:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-07-23 05:35:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-23 05:35:52,741 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 38 [2022-07-23 05:35:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:52,741 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-23 05:35:52,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-23 05:35:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:35:52,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:52,742 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:52,777 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-23 05:35:52,952 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,SelfDestructingSolverStorable23 [2022-07-23 05:35:52,953 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:35:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2022-07-23 05:35:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:52,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018555681] [2022-07-23 05:35:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018555681] [2022-07-23 05:35:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018555681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739230588] [2022-07-23 05:35:53,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:35:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:53,238 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-23 05:35:53,239 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-23 05:35:53,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-23 05:35:53,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:53,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:35:53,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:53,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:53,789 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 22 treesize of output 18 [2022-07-23 05:35:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739230588] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:53,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:53,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-07-23 05:35:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347999804] [2022-07-23 05:35:53,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:53,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-23 05:35:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-23 05:35:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-07-23 05:35:53,919 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 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-23 05:35:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:54,320 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-23 05:35:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:35:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 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 42 [2022-07-23 05:35:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:54,321 INFO L225 Difference]: With dead ends: 57 [2022-07-23 05:35:54,321 INFO L226 Difference]: Without dead ends: 57 [2022-07-23 05:35:54,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1633, Unknown=0, NotChecked=0, Total=2070 [2022-07-23 05:35:54,322 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:54,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 146 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:35:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-23 05:35:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-23 05:35:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-07-23 05:35:54,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 42 [2022-07-23 05:35:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:54,323 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-07-23 05:35:54,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 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-23 05:35:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-07-23 05:35:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 05:35:54,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:54,324 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:54,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-23 05:35:54,524 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,SelfDestructingSolverStorable24 [2022-07-23 05:35:54,525 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:35:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2022-07-23 05:35:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:54,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625981849] [2022-07-23 05:35:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:55,010 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-23 05:35:55,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:55,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625981849] [2022-07-23 05:35:55,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625981849] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:55,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524728588] [2022-07-23 05:35:55,011 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:35:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:55,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:55,012 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-23 05:35:55,013 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-23 05:35:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:55,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-23 05:35:55,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:55,101 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-23 05:35:55,304 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-23 05:35:55,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:35:55,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-23 05:35:55,537 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-23 05:35:55,550 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-23 05:35:55,569 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-23 05:35:55,572 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-23 05:35:55,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:55,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:35:55,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_501) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:55,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:35:55,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:55,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, 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-23 05:35:55,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:55,631 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-23 05:35:55,634 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-23 05:35:55,800 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-23 05:35:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524728588] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:55,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:55,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2022-07-23 05:35:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090116841] [2022-07-23 05:35:55,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:55,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 05:35:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 05:35:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2022-07-23 05:35:55,802 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:56,523 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-23 05:35:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 05:35:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-23 05:35:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:56,524 INFO L225 Difference]: With dead ends: 86 [2022-07-23 05:35:56,524 INFO L226 Difference]: Without dead ends: 64 [2022-07-23 05:35:56,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=2087, Unknown=9, NotChecked=900, Total=3192 [2022-07-23 05:35:56,525 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:56,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 343 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 512 Invalid, 0 Unknown, 388 Unchecked, 0.2s Time] [2022-07-23 05:35:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-23 05:35:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-07-23 05:35:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 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-23 05:35:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-23 05:35:56,526 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 46 [2022-07-23 05:35:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:56,526 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-23 05:35:56,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-23 05:35:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 05:35:56,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:56,527 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:56,546 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-23 05:35:56,736 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,SelfDestructingSolverStorable25 [2022-07-23 05:35:56,736 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:35:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2022-07-23 05:35:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:56,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502813210] [2022-07-23 05:35:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:56,971 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-23 05:35:56,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502813210] [2022-07-23 05:35:56,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502813210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276168486] [2022-07-23 05:35:56,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:35:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:56,973 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-23 05:35:56,974 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-23 05:35:57,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:35:57,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:57,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-23 05:35:57,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:57,278 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-23 05:35:57,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:57,536 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-23 05:35:57,572 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-23 05:35:57,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276168486] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:57,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:57,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-23 05:35:57,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185055471] [2022-07-23 05:35:57,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:57,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 05:35:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 05:35:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 05:35:57,574 INFO L87 Difference]: Start difference. First operand 61 states and 64 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-23 05:35:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:58,120 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-23 05:35:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:35:58,121 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-23 05:35:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:58,121 INFO L225 Difference]: With dead ends: 61 [2022-07-23 05:35:58,121 INFO L226 Difference]: Without dead ends: 61 [2022-07-23 05:35:58,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 05:35:58,122 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:58,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:35:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-23 05:35:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-23 05:35:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 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-23 05:35:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-07-23 05:35:58,124 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2022-07-23 05:35:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:58,124 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-07-23 05:35:58,124 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-23 05:35:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-07-23 05:35:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 05:35:58,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:58,124 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:58,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 05:35:58,325 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,SelfDestructingSolverStorable26 [2022-07-23 05:35:58,325 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:35:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2022-07-23 05:35:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:58,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034146603] [2022-07-23 05:35:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:58,911 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-23 05:35:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:58,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034146603] [2022-07-23 05:35:58,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034146603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:58,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567698894] [2022-07-23 05:35:58,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:35:58,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:58,913 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-23 05:35:58,914 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-23 05:35:59,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-23 05:35:59,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:59,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2022-07-23 05:35:59,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:59,144 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-23 05:35:59,502 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-23 05:35:59,667 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-23 05:35:59,790 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-23 05:35:59,917 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-23 05:36:00,051 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-23 05:36:00,195 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-23 05:36:00,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:36:00,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:00,299 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-23 05:36:00,303 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-23 05:36:00,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:00,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:36:00,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_622) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_621) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_620) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_619) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:00,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:00,381 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-23 05:36:00,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:00,389 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-23 05:36:00,395 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-23 05:36:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2022-07-23 05:36:00,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567698894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:00,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:00,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 69 [2022-07-23 05:36:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138427310] [2022-07-23 05:36:00,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:00,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-23 05:36:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-23 05:36:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3127, Unknown=11, NotChecked=1342, Total=4692 [2022-07-23 05:36:00,744 INFO L87 Difference]: Start difference. First operand 61 states and 63 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-23 05:36:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:02,062 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-23 05:36:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 05:36:02,062 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 54 [2022-07-23 05:36:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:02,063 INFO L225 Difference]: With dead ends: 94 [2022-07-23 05:36:02,063 INFO L226 Difference]: Without dead ends: 68 [2022-07-23 05:36:02,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=361, Invalid=5834, Unknown=11, NotChecked=1804, Total=8010 [2022-07-23 05:36:02,066 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:02,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 533 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 706 Invalid, 0 Unknown, 727 Unchecked, 0.3s Time] [2022-07-23 05:36:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-23 05:36:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-23 05:36:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-07-23 05:36:02,068 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2022-07-23 05:36:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:02,068 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-07-23 05:36:02,069 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-23 05:36:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-07-23 05:36:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 05:36:02,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:02,070 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:02,088 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-23 05:36:02,288 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,SelfDestructingSolverStorable27 [2022-07-23 05:36:02,288 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2022-07-23 05:36:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041673590] [2022-07-23 05:36:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:02,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041673590] [2022-07-23 05:36:02,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041673590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:02,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472859446] [2022-07-23 05:36:02,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:36:02,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:02,640 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-23 05:36:02,648 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-23 05:36:02,742 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:36:02,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:02,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-23 05:36:02,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:02,751 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-23 05:36:02,756 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-23 05:36:03,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 05:36:03,244 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-23 05:36:03,347 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-23 05:36:03,451 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-23 05:36:03,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 18 treesize of output 20 [2022-07-23 05:36:03,676 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-23 05:36:03,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:03,801 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-23 05:36:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:03,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:04,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:36:04,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (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_696) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0))) is different from false [2022-07-23 05:36:04,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:04,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, 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-23 05:36:04,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:04,669 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-23 05:36:04,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:36:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-23 05:36:05,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472859446] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:05,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:05,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2022-07-23 05:36:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256969206] [2022-07-23 05:36:05,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:05,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-23 05:36:05,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:05,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-23 05:36:05,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=3727, Unknown=7, NotChecked=254, Total=4422 [2022-07-23 05:36:05,612 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:07,440 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or (not (= (+ (- 1) .cse0) (+ (- 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (or (and (<= 0 .cse1) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse0)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (<= .cse1 .cse0) (<= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6) (<= 6 .cse0) (<= 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2022-07-23 05:36:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:07,677 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-07-23 05:36:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-23 05:36:07,677 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 05:36:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:07,678 INFO L225 Difference]: With dead ends: 68 [2022-07-23 05:36:07,678 INFO L226 Difference]: Without dead ends: 68 [2022-07-23 05:36:07,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1132, Invalid=6676, Unknown=36, NotChecked=528, Total=8372 [2022-07-23 05:36:07,680 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 112 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:07,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 370 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 780 Invalid, 0 Unknown, 473 Unchecked, 0.4s Time] [2022-07-23 05:36:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-23 05:36:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-23 05:36:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-23 05:36:07,681 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2022-07-23 05:36:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:07,681 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-23 05:36:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-23 05:36:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-23 05:36:07,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:07,682 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:07,699 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-23 05:36:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:07,882 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2106334426, now seen corresponding path program 4 times [2022-07-23 05:36:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:07,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672895720] [2022-07-23 05:36:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:08,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672895720] [2022-07-23 05:36:08,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672895720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:08,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474414206] [2022-07-23 05:36:08,210 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:36:08,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:08,223 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-23 05:36:08,225 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-23 05:36:08,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:36:08,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:08,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 05:36:08,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:08,339 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:36:08,339 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-23 05:36:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 92 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:08,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 91 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:09,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474414206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:09,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:09,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 47 [2022-07-23 05:36:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362252193] [2022-07-23 05:36:09,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:09,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-23 05:36:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:09,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-23 05:36:09,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2022-07-23 05:36:09,165 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:09,722 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-23 05:36:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 05:36:09,722 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 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 63 [2022-07-23 05:36:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:09,723 INFO L225 Difference]: With dead ends: 107 [2022-07-23 05:36:09,723 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 05:36:09,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=859, Invalid=3173, Unknown=0, NotChecked=0, Total=4032 [2022-07-23 05:36:09,724 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:09,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:36:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 05:36:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-23 05:36:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.042857142857143) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-23 05:36:09,726 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 63 [2022-07-23 05:36:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:09,726 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-23 05:36:09,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-23 05:36:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 05:36:09,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:09,726 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:09,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 05:36:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:09,933 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash 717029661, now seen corresponding path program 5 times [2022-07-23 05:36:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:09,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694770679] [2022-07-23 05:36:09,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 45 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694770679] [2022-07-23 05:36:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694770679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623835236] [2022-07-23 05:36:10,292 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:36:10,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:10,304 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-23 05:36:10,305 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-23 05:36:10,522 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-23 05:36:10,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:10,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-23 05:36:10,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:10,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:36:10,537 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-23 05:36:10,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 10 treesize of output 8 [2022-07-23 05:36:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:11,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:11,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623835236] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:11,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:11,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-07-23 05:36:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008796725] [2022-07-23 05:36:11,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:11,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-23 05:36:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-23 05:36:11,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2022-07-23 05:36:11,677 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:12,313 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-07-23 05:36:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 05:36:12,313 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 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 67 [2022-07-23 05:36:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:12,314 INFO L225 Difference]: With dead ends: 74 [2022-07-23 05:36:12,314 INFO L226 Difference]: Without dead ends: 74 [2022-07-23 05:36:12,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=913, Invalid=4057, Unknown=0, NotChecked=0, Total=4970 [2022-07-23 05:36:12,315 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:12,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:36:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-23 05:36:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-07-23 05:36:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-23 05:36:12,318 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2022-07-23 05:36:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:12,318 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-23 05:36:12,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-23 05:36:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 05:36:12,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:12,319 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:12,337 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-23 05:36:12,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:12,531 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2136703776, now seen corresponding path program 11 times [2022-07-23 05:36:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:12,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182876779] [2022-07-23 05:36:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182876779] [2022-07-23 05:36:13,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182876779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078202758] [2022-07-23 05:36:13,453 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:36:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:13,454 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-23 05:36:13,456 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-23 05:36:13,983 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-23 05:36:13,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:13,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-23 05:36:13,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:13,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:36:14,381 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-23 05:36:14,573 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-23 05:36:14,632 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-23 05:36:14,672 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-23 05:36:14,717 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-23 05:36:14,755 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-23 05:36:14,793 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-23 05:36:14,803 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-23 05:36:14,807 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-23 05:36:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:14,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:14,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:36:14,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_917 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:14,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:14,885 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-23 05:36:14,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:14,889 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-23 05:36:14,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:36:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2022-07-23 05:36:15,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078202758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:15,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:15,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 72 [2022-07-23 05:36:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881706935] [2022-07-23 05:36:15,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:15,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-23 05:36:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-23 05:36:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3037, Unknown=15, NotChecked=1860, Total=5112 [2022-07-23 05:36:15,095 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:16,589 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-07-23 05:36:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 05:36:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 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 70 [2022-07-23 05:36:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:16,591 INFO L225 Difference]: With dead ends: 114 [2022-07-23 05:36:16,591 INFO L226 Difference]: Without dead ends: 80 [2022-07-23 05:36:16,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 16 SemanticMatches, 86 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=5002, Unknown=15, NotChecked=2340, Total=7656 [2022-07-23 05:36:16,593 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:16,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 678 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1305 Invalid, 0 Unknown, 1207 Unchecked, 0.5s Time] [2022-07-23 05:36:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-23 05:36:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-07-23 05:36:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-07-23 05:36:16,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2022-07-23 05:36:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:16,609 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-07-23 05:36:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-07-23 05:36:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 05:36:16,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:16,610 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:16,629 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-23 05:36:16,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:16,811 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1499060029, now seen corresponding path program 12 times [2022-07-23 05:36:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:16,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326396652] [2022-07-23 05:36:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326396652] [2022-07-23 05:36:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326396652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476079856] [2022-07-23 05:36:17,106 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:36:17,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:17,107 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-23 05:36:17,109 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-23 05:36:17,692 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-23 05:36:17,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:17,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-23 05:36:17,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:17,710 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:36:17,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:36:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:18,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 120 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:19,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476079856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:19,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:19,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2022-07-23 05:36:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968781094] [2022-07-23 05:36:19,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:19,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-23 05:36:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:19,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-23 05:36:19,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3314, Unknown=0, NotChecked=0, Total=3782 [2022-07-23 05:36:19,144 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:20,416 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-07-23 05:36:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 05:36:20,416 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-23 05:36:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:20,417 INFO L225 Difference]: With dead ends: 83 [2022-07-23 05:36:20,417 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 05:36:20,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1560, Invalid=6272, Unknown=0, NotChecked=0, Total=7832 [2022-07-23 05:36:20,418 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 319 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:20,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 236 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:36:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 05:36:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-23 05:36:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-23 05:36:20,422 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2022-07-23 05:36:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:20,422 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-23 05:36:20,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-23 05:36:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-23 05:36:20,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:20,423 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:20,442 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-23 05:36:20,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:20,642 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:20,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash -773779368, now seen corresponding path program 6 times [2022-07-23 05:36:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:20,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100505575] [2022-07-23 05:36:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 66 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100505575] [2022-07-23 05:36:21,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100505575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189107703] [2022-07-23 05:36:21,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:36:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:21,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:21,096 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-23 05:36:21,105 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-23 05:36:21,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-23 05:36:21,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:21,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-23 05:36:21,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:21,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:36:21,681 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-23 05:36:21,684 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-23 05:36:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:22,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:23,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189107703] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:23,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:23,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 62 [2022-07-23 05:36:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501371323] [2022-07-23 05:36:23,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-23 05:36:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-23 05:36:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3426, Unknown=0, NotChecked=0, Total=3906 [2022-07-23 05:36:23,255 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:24,459 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-07-23 05:36:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 05:36:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-23 05:36:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:24,465 INFO L225 Difference]: With dead ends: 82 [2022-07-23 05:36:24,466 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 05:36:24,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1573, Invalid=6437, Unknown=0, NotChecked=0, Total=8010 [2022-07-23 05:36:24,478 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 415 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:24,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 214 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:36:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 05:36:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-07-23 05:36:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-07-23 05:36:24,485 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-07-23 05:36:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:24,485 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-07-23 05:36:24,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-07-23 05:36:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-23 05:36:24,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:24,491 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:24,512 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-23 05:36:24,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:24,709 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -571678779, now seen corresponding path program 13 times [2022-07-23 05:36:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:24,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918558749] [2022-07-23 05:36:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:25,731 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-23 05:36:25,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:25,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918558749] [2022-07-23 05:36:25,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918558749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:25,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792832494] [2022-07-23 05:36:25,731 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:36:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:25,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:25,733 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-23 05:36:25,734 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-23 05:36:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:25,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-23 05:36:25,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:25,881 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-23 05:36:26,355 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-23 05:36:26,535 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-23 05:36:26,615 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-23 05:36:26,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:36:26,731 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-23 05:36:26,785 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-23 05:36:26,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-23 05:36:26,915 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-23 05:36:26,959 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-23 05:36:26,994 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-23 05:36:26,997 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-23 05:36:26,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:27,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:36:27,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1175) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1174) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1173) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1172) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1171) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1170) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:27,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:27,114 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-23 05:36:27,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:27,121 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-23 05:36:27,125 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-23 05:36:27,582 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-23 05:36:27,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792832494] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:27,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:27,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 82 [2022-07-23 05:36:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652370912] [2022-07-23 05:36:27,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:27,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-23 05:36:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-23 05:36:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3981, Unknown=17, NotChecked=2414, Total=6642 [2022-07-23 05:36:27,584 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:29,463 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2022-07-23 05:36:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-23 05:36:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 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-23 05:36:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:29,464 INFO L225 Difference]: With dead ends: 126 [2022-07-23 05:36:29,465 INFO L226 Difference]: Without dead ends: 88 [2022-07-23 05:36:29,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 106 SyntacticMatches, 25 SemanticMatches, 100 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=354, Invalid=6837, Unknown=17, NotChecked=3094, Total=10302 [2022-07-23 05:36:29,466 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1415 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:29,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 803 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1590 Invalid, 0 Unknown, 1415 Unchecked, 0.6s Time] [2022-07-23 05:36:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-23 05:36:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-23 05:36:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.036144578313253) internal successors, (86), 84 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-07-23 05:36:29,469 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 78 [2022-07-23 05:36:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:29,469 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-07-23 05:36:29,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-07-23 05:36:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 05:36:29,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:29,479 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:29,497 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-23 05:36:29,698 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,SelfDestructingSolverStorable34 [2022-07-23 05:36:29,698 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:29,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 495226146, now seen corresponding path program 14 times [2022-07-23 05:36:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:29,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120514697] [2022-07-23 05:36:29,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:30,098 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-23 05:36:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120514697] [2022-07-23 05:36:30,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120514697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996173716] [2022-07-23 05:36:30,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:36:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:30,112 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-23 05:36:30,113 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-23 05:36:30,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:36:30,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:30,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-23 05:36:30,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:30,257 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:36:30,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:36:31,153 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-23 05:36:31,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 153 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:32,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996173716] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:32,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:32,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2022-07-23 05:36:32,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057979504] [2022-07-23 05:36:32,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:32,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-23 05:36:32,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:32,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-23 05:36:32,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4072, Unknown=0, NotChecked=0, Total=4556 [2022-07-23 05:36:32,206 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:33,989 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-07-23 05:36:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-23 05:36:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 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-23 05:36:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:33,990 INFO L225 Difference]: With dead ends: 91 [2022-07-23 05:36:33,990 INFO L226 Difference]: Without dead ends: 91 [2022-07-23 05:36:33,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1706, Invalid=7800, Unknown=0, NotChecked=0, Total=9506 [2022-07-23 05:36:33,990 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 354 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:33,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 432 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 05:36:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-23 05:36:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-23 05:36:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-23 05:36:33,992 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 82 [2022-07-23 05:36:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:33,992 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-23 05:36:33,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-23 05:36:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 05:36:33,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:33,993 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:34,012 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-23 05:36:34,203 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,SelfDestructingSolverStorable35 [2022-07-23 05:36:34,203 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1827858669, now seen corresponding path program 7 times [2022-07-23 05:36:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003971853] [2022-07-23 05:36:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 91 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003971853] [2022-07-23 05:36:34,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003971853] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507924652] [2022-07-23 05:36:34,606 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:36:34,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:34,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:34,607 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-23 05:36:34,608 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-23 05:36:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:34,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-23 05:36:34,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:34,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:36:34,759 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-23 05:36:34,761 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-23 05:36:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 120 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:35,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:36,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507924652] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:36,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:36,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-07-23 05:36:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510302060] [2022-07-23 05:36:36,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:36,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-23 05:36:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-23 05:36:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=4196, Unknown=0, NotChecked=0, Total=4692 [2022-07-23 05:36:36,783 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:38,344 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-07-23 05:36:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-23 05:36:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 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 83 [2022-07-23 05:36:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:38,345 INFO L225 Difference]: With dead ends: 90 [2022-07-23 05:36:38,345 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 05:36:38,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1719, Invalid=7983, Unknown=0, NotChecked=0, Total=9702 [2022-07-23 05:36:38,345 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 568 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:38,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 378 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 05:36:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 05:36:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-07-23 05:36:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-07-23 05:36:38,347 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2022-07-23 05:36:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:38,347 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-23 05:36:38,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-07-23 05:36:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-23 05:36:38,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:38,348 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:38,365 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-23 05:36:38,555 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,SelfDestructingSolverStorable36 [2022-07-23 05:36:38,555 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2142233814, now seen corresponding path program 15 times [2022-07-23 05:36:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:38,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542977701] [2022-07-23 05:36:38,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:39,755 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-23 05:36:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542977701] [2022-07-23 05:36:39,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542977701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717492185] [2022-07-23 05:36:39,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:36:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:39,756 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-23 05:36:39,758 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-23 05:36:40,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-23 05:36:40,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:40,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-23 05:36:40,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:40,808 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-23 05:36:41,419 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-23 05:36:41,606 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-23 05:36:41,755 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-23 05:36:41,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 16 treesize of output 18 [2022-07-23 05:36:42,047 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-23 05:36:42,184 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-23 05:36:42,325 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-23 05:36:42,466 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-23 05:36:42,600 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-23 05:36:42,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-23 05:36:42,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:36:42,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:42,866 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-23 05:36:42,869 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-23 05:36:42,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:42,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:36:42,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1455) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1454) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:36:42,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1453) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1452) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1451) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1450) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1457 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1449) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:42,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:42,975 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-23 05:36:42,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:42,980 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-23 05:36:42,983 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-23 05:36:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 179 not checked. [2022-07-23 05:36:43,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717492185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:43,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:43,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 109 [2022-07-23 05:36:43,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724883021] [2022-07-23 05:36:43,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:43,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-23 05:36:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:43,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-23 05:36:43,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=7735, Unknown=19, NotChecked=3686, Total=11772 [2022-07-23 05:36:43,595 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:45,566 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2022-07-23 05:36:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-23 05:36:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-23 05:36:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:45,567 INFO L225 Difference]: With dead ends: 138 [2022-07-23 05:36:45,567 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 05:36:45,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 19 IntricatePredicates, 6 DeprecatedPredicates, 3987 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=533, Invalid=13566, Unknown=19, NotChecked=4788, Total=18906 [2022-07-23 05:36:45,571 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2070 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:45,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1357 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1470 Invalid, 0 Unknown, 2070 Unchecked, 0.4s Time] [2022-07-23 05:36:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 05:36:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-07-23 05:36:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.032967032967033) internal successors, (94), 92 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-23 05:36:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-07-23 05:36:45,578 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 86 [2022-07-23 05:36:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:45,578 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-07-23 05:36:45,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-07-23 05:36:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-23 05:36:45,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:45,579 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:45,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-23 05:36:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:45,791 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1422334855, now seen corresponding path program 16 times [2022-07-23 05:36:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704112288] [2022-07-23 05:36:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 120 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:46,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704112288] [2022-07-23 05:36:46,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704112288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:46,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990758099] [2022-07-23 05:36:46,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:36:46,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:46,257 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-23 05:36:46,258 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-23 05:36:46,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:36:46,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:46,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 174 conjunts are in the unsatisfiable core [2022-07-23 05:36:46,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:46,434 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:36:46,434 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-23 05:36:46,438 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-23 05:36:46,858 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-23 05:36:47,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:47,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:47,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:47,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:47,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:47,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:47,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:48,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:48,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 05:36:48,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:48,374 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 22 treesize of output 22 [2022-07-23 05:36:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:48,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:50,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0))) is different from false [2022-07-23 05:36:50,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|))) is different from false [2022-07-23 05:36:50,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:50,401 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-23 05:36:50,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:50,406 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-23 05:36:50,409 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-23 05:36:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-23 05:36:52,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990758099] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:52,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:52,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37, 37] total 98 [2022-07-23 05:36:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245510437] [2022-07-23 05:36:52,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:52,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-23 05:36:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-23 05:36:52,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=8427, Unknown=12, NotChecked=382, Total=9702 [2022-07-23 05:36:52,023 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:55,048 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (and (<= 0 .cse0) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1)) (forall ((v_ArrVal_1565 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (exists ((|ULTIMATE.start_main_~nondetString~0#1.offset| Int)) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|))) (and (<= (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 10) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ (- 1) .cse2 |ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| (+ 9 |ULTIMATE.start_main_~nondetString~0#1.offset|))))) (<= .cse0 .cse1) (<= 9 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|))) is different from false [2022-07-23 05:36:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:55,362 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-23 05:36:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-23 05:36:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 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 90 [2022-07-23 05:36:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:55,363 INFO L225 Difference]: With dead ends: 101 [2022-07-23 05:36:55,363 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 05:36:55,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3976 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1891, Invalid=18099, Unknown=44, NotChecked=846, Total=20880 [2022-07-23 05:36:55,364 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 95 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 982 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:55,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 719 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 629 Invalid, 0 Unknown, 982 Unchecked, 0.2s Time] [2022-07-23 05:36:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 05:36:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-07-23 05:36:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 99 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-23 05:36:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-23 05:36:55,369 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 90 [2022-07-23 05:36:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:55,369 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-23 05:36:55,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-23 05:36:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 05:36:55,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:55,370 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:55,387 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-23 05:36:55,583 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,SelfDestructingSolverStorable38 [2022-07-23 05:36:55,584 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:36:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1142707534, now seen corresponding path program 8 times [2022-07-23 05:36:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:55,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373755437] [2022-07-23 05:36:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 120 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:56,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:56,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373755437] [2022-07-23 05:36:56,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373755437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:56,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141875033] [2022-07-23 05:36:56,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:36:56,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:56,102 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-23 05:36:56,103 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-23 05:36:56,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:36:56,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:56,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-23 05:36:56,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:56,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:36:56,288 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-23 05:36:56,290 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-23 05:36:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 153 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:57,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:58,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141875033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:58,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 74 [2022-07-23 05:36:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394204422] [2022-07-23 05:36:58,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:58,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-23 05:36:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-23 05:36:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-07-23 05:36:58,585 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:00,542 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-23 05:37:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-23 05:37:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 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 91 [2022-07-23 05:37:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:00,543 INFO L225 Difference]: With dead ends: 100 [2022-07-23 05:37:00,543 INFO L226 Difference]: Without dead ends: 100 [2022-07-23 05:37:00,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2047, Invalid=9509, Unknown=0, NotChecked=0, Total=11556 [2022-07-23 05:37:00,544 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 401 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:00,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 571 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 05:37:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-23 05:37:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-23 05:37:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.030612244897959) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-07-23 05:37:00,545 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2022-07-23 05:37:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:00,545 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-07-23 05:37:00,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-07-23 05:37:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 05:37:00,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:00,546 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:00,571 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-23 05:37:00,746 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,SelfDestructingSolverStorable39 [2022-07-23 05:37:00,746 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2009926970, now seen corresponding path program 9 times [2022-07-23 05:37:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920838504] [2022-07-23 05:37:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 221 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920838504] [2022-07-23 05:37:01,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920838504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391278031] [2022-07-23 05:37:01,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:37:01,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:01,209 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-23 05:37:01,211 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-23 05:37:02,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-23 05:37:02,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:02,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-23 05:37:02,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:02,545 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:37:02,545 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-23 05:37:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:03,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391278031] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:04,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:04,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-07-23 05:37:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931253883] [2022-07-23 05:37:04,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-23 05:37:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-23 05:37:04,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=3663, Unknown=0, NotChecked=0, Total=4422 [2022-07-23 05:37:04,232 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:04,694 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-23 05:37:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 05:37:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-23 05:37:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:04,700 INFO L225 Difference]: With dead ends: 155 [2022-07-23 05:37:04,700 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 05:37:04,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1313, Invalid=5329, Unknown=0, NotChecked=0, Total=6642 [2022-07-23 05:37:04,707 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:04,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 182 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:37:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 05:37:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-23 05:37:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-07-23 05:37:04,710 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 95 [2022-07-23 05:37:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:04,711 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-07-23 05:37:04,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-07-23 05:37:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-23 05:37:04,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:04,711 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:04,731 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-23 05:37:04,930 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,SelfDestructingSolverStorable40 [2022-07-23 05:37:04,931 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2008413431, now seen corresponding path program 10 times [2022-07-23 05:37:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:04,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429596747] [2022-07-23 05:37:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 153 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429596747] [2022-07-23 05:37:05,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429596747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801022302] [2022-07-23 05:37:05,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:37:05,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:05,424 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-23 05:37:05,425 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-23 05:37:05,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:37:05,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:05,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-23 05:37:05,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:05,628 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:37:05,629 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-23 05:37:05,635 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-23 05:37:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-23 05:37:06,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-23 05:37:07,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801022302] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:07,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:07,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 18] total 62 [2022-07-23 05:37:07,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031141308] [2022-07-23 05:37:07,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:07,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-23 05:37:07,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-23 05:37:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3470, Unknown=0, NotChecked=0, Total=3906 [2022-07-23 05:37:07,677 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:13,945 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-23 05:37:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-23 05:37:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 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 99 [2022-07-23 05:37:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:13,946 INFO L225 Difference]: With dead ends: 160 [2022-07-23 05:37:13,946 INFO L226 Difference]: Without dead ends: 160 [2022-07-23 05:37:13,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3021, Invalid=14009, Unknown=0, NotChecked=0, Total=17030 [2022-07-23 05:37:13,948 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 404 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:13,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 665 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2158 Invalid, 0 Unknown, 2 Unchecked, 1.0s Time] [2022-07-23 05:37:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-23 05:37:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2022-07-23 05:37:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-07-23 05:37:13,962 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 99 [2022-07-23 05:37:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:13,962 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-07-23 05:37:13,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-07-23 05:37:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-23 05:37:13,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:13,963 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:13,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-23 05:37:14,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:14,183 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 544873332, now seen corresponding path program 17 times [2022-07-23 05:37:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:14,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521838105] [2022-07-23 05:37:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:15,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:15,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521838105] [2022-07-23 05:37:15,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521838105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:15,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598275484] [2022-07-23 05:37:15,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:37:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:15,735 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:37:15,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-23 05:37:16,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-07-23 05:37:16,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:16,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 205 conjunts are in the unsatisfiable core [2022-07-23 05:37:16,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:16,799 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-23 05:37:17,490 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-23 05:37:17,697 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-23 05:37:17,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:17,856 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-23 05:37:17,928 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-23 05:37:17,997 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-23 05:37:18,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:18,133 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-23 05:37:18,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:18,289 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-23 05:37:18,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:37:18,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-23 05:37:18,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:37:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:18,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:18,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:37:18,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1989) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:37:18,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1988) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1987) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1986) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1985) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1984) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1983) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1982) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1981) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1980) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:18,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:37:18,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:18,521 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-23 05:37:18,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:18,526 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-23 05:37:18,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:37:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 263 not checked. [2022-07-23 05:37:19,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598275484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:19,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:19,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 42, 42] total 104 [2022-07-23 05:37:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850296621] [2022-07-23 05:37:19,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:19,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-23 05:37:19,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-23 05:37:19,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=6261, Unknown=23, NotChecked=4140, Total=10712 [2022-07-23 05:37:19,124 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:22,635 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-07-23 05:37:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-23 05:37:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 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 102 [2022-07-23 05:37:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:22,636 INFO L225 Difference]: With dead ends: 206 [2022-07-23 05:37:22,636 INFO L226 Difference]: Without dead ends: 156 [2022-07-23 05:37:22,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 144 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=427, Invalid=10354, Unknown=23, NotChecked=5198, Total=16002 [2022-07-23 05:37:22,637 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2062 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:22,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1289 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2639 Invalid, 0 Unknown, 2062 Unchecked, 1.1s Time] [2022-07-23 05:37:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-23 05:37:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2022-07-23 05:37:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.0927152317880795) internal successors, (165), 152 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2022-07-23 05:37:22,639 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 102 [2022-07-23 05:37:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:22,639 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2022-07-23 05:37:22,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2022-07-23 05:37:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 05:37:22,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:22,640 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:22,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-23 05:37:22,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:22,840 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:22,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1957085649, now seen corresponding path program 18 times [2022-07-23 05:37:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:22,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661689296] [2022-07-23 05:37:22,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:22,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 190 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:23,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661689296] [2022-07-23 05:37:23,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661689296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:23,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509495512] [2022-07-23 05:37:23,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:37:23,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:23,340 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:37:23,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-23 05:37:26,273 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-23 05:37:26,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:26,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-23 05:37:26,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:26,299 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:37:26,299 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-23 05:37:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 231 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:27,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 276 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:29,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509495512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:29,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:29,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-07-23 05:37:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911735540] [2022-07-23 05:37:29,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:29,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-23 05:37:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-23 05:37:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=6476, Unknown=0, NotChecked=0, Total=7310 [2022-07-23 05:37:29,115 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:31,607 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-23 05:37:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-23 05:37:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 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-23 05:37:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:31,609 INFO L225 Difference]: With dead ends: 153 [2022-07-23 05:37:31,609 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 05:37:31,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3022, Invalid=12478, Unknown=0, NotChecked=0, Total=15500 [2022-07-23 05:37:31,610 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 463 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:31,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 474 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 05:37:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 05:37:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-23 05:37:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.086092715231788) internal successors, (164), 152 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-23 05:37:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-23 05:37:31,613 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 106 [2022-07-23 05:37:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:31,613 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-23 05:37:31,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-23 05:37:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 05:37:31,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:31,614 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:31,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-23 05:37:31,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:31,814 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1557815385, now seen corresponding path program 19 times [2022-07-23 05:37:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:31,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791124759] [2022-07-23 05:37:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:33,568 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-23 05:37:33,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791124759] [2022-07-23 05:37:33,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791124759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116788651] [2022-07-23 05:37:33,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:37:33,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:33,570 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:37:33,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-23 05:37:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:33,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 220 conjunts are in the unsatisfiable core [2022-07-23 05:37:33,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:33,791 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-23 05:37:34,363 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-23 05:37:34,532 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-23 05:37:34,604 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-23 05:37:34,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 16 treesize of output 18 [2022-07-23 05:37:34,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-23 05:37:34,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-23 05:37:34,814 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-23 05:37:34,878 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-23 05:37:34,955 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-23 05:37:35,029 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-23 05:37:35,103 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-23 05:37:35,179 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-23 05:37:35,190 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-23 05:37:35,196 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-23 05:37:35,198 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-23 05:37:35,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:35,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:37:35,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2231) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:37:35,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2230 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2230) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2229) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:37:35,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2228) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2227) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2226) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2225) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2224) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2223) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2222) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2221) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:35,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:35,326 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-23 05:37:35,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:35,330 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-23 05:37:35,332 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-23 05:37:36,013 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-23 05:37:36,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116788651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:36,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:36,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 112 [2022-07-23 05:37:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859437360] [2022-07-23 05:37:36,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:36,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-23 05:37:36,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:36,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-23 05:37:36,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7247, Unknown=25, NotChecked=4850, Total=12432 [2022-07-23 05:37:36,015 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:39,962 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2022-07-23 05:37:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-23 05:37:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 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-23 05:37:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:39,963 INFO L225 Difference]: With dead ends: 214 [2022-07-23 05:37:39,963 INFO L226 Difference]: Without dead ends: 160 [2022-07-23 05:37:39,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 154 SyntacticMatches, 39 SemanticMatches, 136 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3693 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=464, Invalid=12267, Unknown=25, NotChecked=6150, Total=18906 [2022-07-23 05:37:39,964 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 6839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2670 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:39,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1607 Invalid, 6839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4114 Invalid, 0 Unknown, 2670 Unchecked, 1.5s Time] [2022-07-23 05:37:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-23 05:37:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-07-23 05:37:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0838709677419356) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-07-23 05:37:39,966 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 110 [2022-07-23 05:37:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:39,966 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-07-23 05:37:39,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-07-23 05:37:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 05:37:39,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:39,967 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:39,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-23 05:37:40,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-23 05:37:40,168 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash 31283638, now seen corresponding path program 20 times [2022-07-23 05:37:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942718590] [2022-07-23 05:37:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:40,811 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-23 05:37:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:40,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942718590] [2022-07-23 05:37:40,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942718590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:40,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745389034] [2022-07-23 05:37:40,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:37:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:40,812 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:37:40,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-23 05:37:41,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:37:41,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:41,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-23 05:37:41,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:41,055 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:37:41,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:37:42,397 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-23 05:37:42,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 325 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:43,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745389034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:43,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:43,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 92 [2022-07-23 05:37:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864392332] [2022-07-23 05:37:43,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-07-23 05:37:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:43,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-07-23 05:37:43,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=970, Invalid=7586, Unknown=0, NotChecked=0, Total=8556 [2022-07-23 05:37:43,756 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 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-23 05:37:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:45,486 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-07-23 05:37:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-23 05:37:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 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 114 [2022-07-23 05:37:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:45,487 INFO L225 Difference]: With dead ends: 157 [2022-07-23 05:37:45,487 INFO L226 Difference]: Without dead ends: 157 [2022-07-23 05:37:45,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2618, Invalid=12388, Unknown=0, NotChecked=0, Total=15006 [2022-07-23 05:37:45,489 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 243 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:45,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 668 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 05:37:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-23 05:37:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-23 05:37:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 156 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-07-23 05:37:45,491 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 114 [2022-07-23 05:37:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:45,491 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-07-23 05:37:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 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-23 05:37:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-07-23 05:37:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-23 05:37:45,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:45,491 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:45,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-23 05:37:45,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:45,703 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:37:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1148682818, now seen corresponding path program 21 times [2022-07-23 05:37:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:45,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477483782] [2022-07-23 05:37:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:47,686 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-23 05:37:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:47,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477483782] [2022-07-23 05:37:47,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477483782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:47,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251210617] [2022-07-23 05:37:47,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:37:47,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:47,688 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:37:47,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-23 05:37:52,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-23 05:37:52,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:52,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 307 conjunts are in the unsatisfiable core [2022-07-23 05:37:52,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:52,657 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-23 05:37:53,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 14 treesize of output 10 [2022-07-23 05:37:53,970 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-23 05:37:54,239 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-23 05:37:54,472 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-23 05:37:54,682 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-23 05:37:54,891 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-23 05:37:55,097 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-23 05:37:55,335 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-23 05:37:55,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:55,773 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-23 05:37:55,984 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-23 05:37:56,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:56,366 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-23 05:37:56,553 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-23 05:37:56,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:37:56,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:56,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 17 treesize of output 10 [2022-07-23 05:37:56,743 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-23 05:37:56,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:56,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:37:56,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2490) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2489) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2488) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2487) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2486) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2485) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2484 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2484) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2483 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2483) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2482) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2481 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2481) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2480 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2480) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:56,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:56,973 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-23 05:37:56,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:56,980 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-23 05:37:56,984 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-23 05:37:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 363 not checked. [2022-07-23 05:37:58,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251210617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:58,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:58,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 149 [2022-07-23 05:37:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58389621] [2022-07-23 05:37:58,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:58,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2022-07-23 05:37:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2022-07-23 05:37:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=14391, Unknown=27, NotChecked=7182, Total=22052 [2022-07-23 05:37:58,427 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:38:03,463 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2022-07-23 05:38:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-23 05:38:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 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-23 05:38:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:38:03,464 INFO L225 Difference]: With dead ends: 222 [2022-07-23 05:38:03,464 INFO L226 Difference]: Without dead ends: 164 [2022-07-23 05:38:03,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 148 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 27 IntricatePredicates, 13 DeprecatedPredicates, 7961 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=736, Invalid=25427, Unknown=27, NotChecked=9342, Total=35532 [2022-07-23 05:38:03,466 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2591 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:38:03,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2094 Invalid, 4943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2335 Invalid, 0 Unknown, 2591 Unchecked, 1.0s Time] [2022-07-23 05:38:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-23 05:38:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2022-07-23 05:38:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0754716981132075) internal successors, (171), 160 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2022-07-23 05:38:03,480 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 118 [2022-07-23 05:38:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:38:03,480 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2022-07-23 05:38:03,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2022-07-23 05:38:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-23 05:38:03,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:38:03,481 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:38:03,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-23 05:38:03,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:03,695 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:38:03,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:38:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1419851237, now seen corresponding path program 22 times [2022-07-23 05:38:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:38:03,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091322322] [2022-07-23 05:38:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:38:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:38:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:38:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 276 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:38:04,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091322322] [2022-07-23 05:38:04,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091322322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:38:04,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691615325] [2022-07-23 05:38:04,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:38:04,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:38:04,378 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:38:04,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-23 05:38:04,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:38:04,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:38:04,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 232 conjunts are in the unsatisfiable core [2022-07-23 05:38:04,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:38:04,699 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-23 05:38:04,702 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-23 05:38:05,531 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-23 05:38:05,740 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-23 05:38:05,873 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-23 05:38:06,016 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-23 05:38:06,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 18 treesize of output 20 [2022-07-23 05:38:06,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:38:06,433 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-23 05:38:06,566 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-23 05:38:06,704 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-23 05:38:06,863 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-23 05:38:07,015 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-23 05:38:07,160 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-23 05:38:07,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:38:07,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 18 treesize of output 20 [2022-07-23 05:38:07,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:38:07,626 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-23 05:38:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 338 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:07,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:38:10,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-23 05:38:10,467 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (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_2635) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-23 05:38:10,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:38:10,473 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-23 05:38:10,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:38:10,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-23 05:38:10,480 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-23 05:38:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 378 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-23 05:38:13,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691615325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:38:13,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:38:13,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 49, 49] total 129 [2022-07-23 05:38:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735495706] [2022-07-23 05:38:13,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:38:13,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-23 05:38:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:38:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-23 05:38:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1502, Invalid=14746, Unknown=16, NotChecked=506, Total=16770 [2022-07-23 05:38:13,069 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:19,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:38:19,348 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2022-07-23 05:38:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-23 05:38:19,348 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 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 122 [2022-07-23 05:38:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:38:19,349 INFO L225 Difference]: With dead ends: 161 [2022-07-23 05:38:19,349 INFO L226 Difference]: Without dead ends: 161 [2022-07-23 05:38:19,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 178 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5721 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=4517, Invalid=26901, Unknown=96, NotChecked=706, Total=32220 [2022-07-23 05:38:19,350 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 373 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1187 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:38:19,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1081 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2195 Invalid, 0 Unknown, 1187 Unchecked, 1.1s Time] [2022-07-23 05:38:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-23 05:38:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-23 05:38:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0628930817610063) internal successors, (169), 160 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2022-07-23 05:38:19,352 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 122 [2022-07-23 05:38:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:38:19,352 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2022-07-23 05:38:19,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2022-07-23 05:38:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-23 05:38:19,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:38:19,353 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:38:19,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-07-23 05:38:19,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-23 05:38:19,554 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:38:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:38:19,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1417438933, now seen corresponding path program 23 times [2022-07-23 05:38:19,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:38:19,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472279337] [2022-07-23 05:38:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:38:19,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:38:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:38:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 468 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:38:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472279337] [2022-07-23 05:38:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472279337] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:38:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914538209] [2022-07-23 05:38:20,163 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:38:20,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:20,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:38:20,164 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:38:20,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-23 05:38:34,792 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-07-23 05:38:34,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:38:34,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-23 05:38:34,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:38:34,844 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:38:34,844 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-23 05:38:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:36,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:38:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:37,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914538209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:38:37,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:38:37,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 86 [2022-07-23 05:38:37,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862346637] [2022-07-23 05:38:37,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:38:37,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-23 05:38:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:38:37,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-23 05:38:37,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1168, Invalid=6142, Unknown=0, NotChecked=0, Total=7310 [2022-07-23 05:38:37,395 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:38:38,952 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2022-07-23 05:38:38,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 05:38:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-07-23 05:38:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:38:38,953 INFO L225 Difference]: With dead ends: 232 [2022-07-23 05:38:38,954 INFO L226 Difference]: Without dead ends: 168 [2022-07-23 05:38:38,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2022-07-23 05:38:38,955 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 151 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:38:38,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 279 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:38:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-23 05:38:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2022-07-23 05:38:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.0613496932515338) internal successors, (173), 164 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2022-07-23 05:38:38,957 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 130 [2022-07-23 05:38:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:38:38,957 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2022-07-23 05:38:38,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2022-07-23 05:38:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-23 05:38:38,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:38:38,958 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:38:38,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-23 05:38:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-23 05:38:39,167 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:38:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:38:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash 367084040, now seen corresponding path program 24 times [2022-07-23 05:38:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:38:39,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276352135] [2022-07-23 05:38:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:38:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:38:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:38:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:41,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:38:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276352135] [2022-07-23 05:38:41,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276352135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:38:41,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957269159] [2022-07-23 05:38:41,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:38:41,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:41,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:38:41,498 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:38:41,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-23 05:38:59,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-23 05:38:59,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:38:59,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 301 conjunts are in the unsatisfiable core [2022-07-23 05:38:59,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:38:59,459 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-23 05:39:00,509 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-23 05:39:00,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:39:01,038 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-23 05:39:01,249 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-23 05:39:01,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 16 treesize of output 18 [2022-07-23 05:39:01,653 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-23 05:39:01,842 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-23 05:39:02,035 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-23 05:39:02,231 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-23 05:39:02,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 16 treesize of output 18 [2022-07-23 05:39:02,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:02,829 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-23 05:39:03,032 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-23 05:39:03,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 16 treesize of output 18 [2022-07-23 05:39:03,457 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-23 05:39:03,655 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-23 05:39:03,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:39:03,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:03,852 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-23 05:39:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:03,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:03,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:39:03,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2927) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2926) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2925) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2924 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2924) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2923) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:39:03,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2921 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:03,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2916) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:39:04,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2914) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:04,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:04,029 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-23 05:39:04,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:04,032 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-23 05:39:04,034 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-23 05:39:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 479 not checked. [2022-07-23 05:39:05,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957269159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:05,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:05,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 54, 54] total 169 [2022-07-23 05:39:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166222717] [2022-07-23 05:39:05,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:05,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 169 states [2022-07-23 05:39:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2022-07-23 05:39:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=18487, Unknown=31, NotChecked=9362, Total=28392 [2022-07-23 05:39:05,122 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:09,444 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2022-07-23 05:39:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-07-23 05:39:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 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 134 [2022-07-23 05:39:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:09,445 INFO L225 Difference]: With dead ends: 238 [2022-07-23 05:39:09,445 INFO L226 Difference]: Without dead ends: 172 [2022-07-23 05:39:09,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 168 SyntacticMatches, 26 SemanticMatches, 202 ConstructedPredicates, 31 IntricatePredicates, 4 DeprecatedPredicates, 10133 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=751, Invalid=29098, Unknown=31, NotChecked=11532, Total=41412 [2022-07-23 05:39:09,447 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3014 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:09,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2244 Invalid, 5777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2744 Invalid, 0 Unknown, 3014 Unchecked, 1.0s Time] [2022-07-23 05:39:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-23 05:39:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2022-07-23 05:39:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.0598802395209581) internal successors, (177), 168 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 177 transitions. [2022-07-23 05:39:09,449 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 177 transitions. Word has length 134 [2022-07-23 05:39:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:09,449 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 177 transitions. [2022-07-23 05:39:09,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 177 transitions. [2022-07-23 05:39:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 05:39:09,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:09,450 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:09,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:09,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-23 05:39:09,650 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1431647333, now seen corresponding path program 25 times [2022-07-23 05:39:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:09,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028685459] [2022-07-23 05:39:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 378 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028685459] [2022-07-23 05:39:10,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028685459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810463130] [2022-07-23 05:39:10,324 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:39:10,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:10,325 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:39:10,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-23 05:39:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:10,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-23 05:39:10,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 435 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:11,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:12,593 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-23 05:39:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 435 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:12,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810463130] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:12,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:12,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 77 [2022-07-23 05:39:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756057296] [2022-07-23 05:39:12,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:12,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-23 05:39:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-23 05:39:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=5446, Unknown=0, NotChecked=0, Total=6006 [2022-07-23 05:39:12,691 INFO L87 Difference]: Start difference. First operand 169 states and 177 transitions. Second operand has 78 states, 77 states have (on average 3.5844155844155843) internal successors, (276), 78 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)