./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:34:49,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:34:49,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:34:49,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:34:49,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:34:49,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:34:49,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:34:49,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:34:49,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:34:49,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:34:49,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:34:49,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:34:49,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:34:49,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:34:49,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:34:49,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:34:49,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:34:49,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:34:49,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:34:49,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:34:49,952 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:34:49,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:34:49,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:34:49,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:34:49,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:34:49,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:34:49,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:34:49,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:34:49,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:34:49,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:34:49,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:34:49,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:34:49,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:34:49,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:34:49,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:34:49,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:34:49,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:34:49,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:34:49,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:34:49,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:34:49,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:34:49,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:34:49,976 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:50,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:34:50,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:34:50,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:34:50,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:34:50,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:34:50,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:34:50,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:34:50,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:34:50,014 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:34:50,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:34:50,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:34:50,015 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:34:50,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:34:50,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:34:50,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:34:50,016 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:34:50,016 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:34:50,017 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:34:50,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:34:50,017 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:34:50,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:34:50,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:34:50,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:34:50,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:34:50,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:34:50,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:34:50,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:34:50,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:34:50,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:34:50,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:34:50,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2022-07-23 05:34:50,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:34:50,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:34:50,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:34:50,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:34:50,307 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:34:50,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-23 05:34:50,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208783ed0/3240d5ba470b4670a450b3a1fa893351/FLAG87ee46c25 [2022-07-23 05:34:50,767 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:34:50,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-23 05:34:50,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208783ed0/3240d5ba470b4670a450b3a1fa893351/FLAG87ee46c25 [2022-07-23 05:34:51,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208783ed0/3240d5ba470b4670a450b3a1fa893351 [2022-07-23 05:34:51,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:34:51,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:34:51,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:34:51,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:34:51,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:34:51,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:34:51" (1/1) ... [2022-07-23 05:34:51,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d92dfbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:51, skipping insertion in model container [2022-07-23 05:34:51,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:34:51" (1/1) ... [2022-07-23 05:34:51,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:34:51,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:34:51,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:34:51,497 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:34:51,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:34:51,556 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:34:51,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:51 WrapperNode [2022-07-23 05:34:51,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:34:51,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:34:51,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:34:51,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:34:51,563 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:51" (1/1) ... [2022-07-23 05:34:51,578 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:51" (1/1) ... [2022-07-23 05:34:51,597 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-07-23 05:34:51,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:34:51,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:34:51,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:34:51,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:34:51,605 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:51" (1/1) ... [2022-07-23 05:34:51,606 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:51" (1/1) ... [2022-07-23 05:34:51,611 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:51" (1/1) ... [2022-07-23 05:34:51,613 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:51" (1/1) ... [2022-07-23 05:34:51,623 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:51" (1/1) ... [2022-07-23 05:34:51,629 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:51" (1/1) ... [2022-07-23 05:34:51,631 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:51" (1/1) ... [2022-07-23 05:34:51,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:34:51,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:34:51,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:34:51,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:34:51,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:51" (1/1) ... [2022-07-23 05:34:51,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:34:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:51,665 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:51,668 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:51,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:34:51,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:34:51,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:34:51,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:34:51,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:34:51,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:34:51,781 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:34:51,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:34:51,979 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:34:51,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:34:51,985 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 05:34:51,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:34:51 BoogieIcfgContainer [2022-07-23 05:34:51,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:34:51,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:34:51,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:34:52,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:34:52,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:34:51" (1/3) ... [2022-07-23 05:34:52,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c10f606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:34:52, skipping insertion in model container [2022-07-23 05:34:52,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:34:51" (2/3) ... [2022-07-23 05:34:52,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c10f606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:34:52, skipping insertion in model container [2022-07-23 05:34:52,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:34:51" (3/3) ... [2022-07-23 05:34:52,004 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2022-07-23 05:34:52,016 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:34:52,016 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-23 05:34:52,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:34:52,067 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@664be33a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33a986b6 [2022-07-23 05:34:52,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-23 05:34:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:52,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:52,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:52,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-23 05:34:52,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:52,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492361493] [2022-07-23 05:34:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:52,254 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:52,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:52,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492361493] [2022-07-23 05:34:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492361493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:52,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:34:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208340753] [2022-07-23 05:34:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:52,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:34:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:34:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:34:52,291 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:52,358 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-23 05:34:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:34:52,360 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:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:52,366 INFO L225 Difference]: With dead ends: 33 [2022-07-23 05:34:52,366 INFO L226 Difference]: Without dead ends: 31 [2022-07-23 05:34:52,368 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:52,371 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:52,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-23 05:34:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-23 05:34:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-23 05:34:52,398 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2022-07-23 05:34:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:52,398 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-23 05:34:52,399 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:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-23 05:34:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:52,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:52,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:52,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:34:52,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-23 05:34:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:52,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620837659] [2022-07-23 05:34:52,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:52,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:52,462 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:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:52,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620837659] [2022-07-23 05:34:52,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620837659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:52,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:52,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:34:52,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943851050] [2022-07-23 05:34:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:52,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:52,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:52,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:52,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:52,467 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:52,507 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-23 05:34:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:52,508 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:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:52,510 INFO L225 Difference]: With dead ends: 30 [2022-07-23 05:34:52,511 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 05:34:52,515 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:52,517 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:52,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 05:34:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-23 05:34:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-23 05:34:52,525 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2022-07-23 05:34:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:52,525 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-23 05:34:52,525 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:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-23 05:34:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:52,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:52,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:52,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:34:52,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-23 05:34:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:52,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131567611] [2022-07-23 05:34:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:52,573 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:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:52,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131567611] [2022-07-23 05:34:52,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131567611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:52,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:52,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343040287] [2022-07-23 05:34:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:52,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:52,591 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:52,619 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-23 05:34:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:52,620 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:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:52,621 INFO L225 Difference]: With dead ends: 53 [2022-07-23 05:34:52,621 INFO L226 Difference]: Without dead ends: 53 [2022-07-23 05:34:52,622 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:52,623 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:52,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-23 05:34:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-23 05:34:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-23 05:34:52,628 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-23 05:34:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:52,629 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-23 05:34:52,629 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:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-23 05:34:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:34:52,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:52,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:52,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:34:52,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-23 05:34:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:52,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928148160] [2022-07-23 05:34:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:52,699 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:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:52,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928148160] [2022-07-23 05:34:52,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928148160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:52,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:52,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:34:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195914353] [2022-07-23 05:34:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:52,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:52,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:52,704 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:52,785 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-23 05:34:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:52,785 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:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:52,788 INFO L225 Difference]: With dead ends: 57 [2022-07-23 05:34:52,790 INFO L226 Difference]: Without dead ends: 57 [2022-07-23 05:34:52,790 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:52,792 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:52,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-23 05:34:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-07-23 05:34:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-23 05:34:52,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2022-07-23 05:34:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:52,802 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-23 05:34:52,803 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:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-23 05:34:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:34:52,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:52,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:52,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:34:52,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 629680341, now seen corresponding path program 1 times [2022-07-23 05:34:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:52,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752799711] [2022-07-23 05:34:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:52,959 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:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:52,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752799711] [2022-07-23 05:34:52,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752799711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:52,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:52,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:34:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649486522] [2022-07-23 05:34:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:34:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:34:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:34:52,963 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:53,056 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-23 05:34:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:34:53,057 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:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:53,057 INFO L225 Difference]: With dead ends: 46 [2022-07-23 05:34:53,057 INFO L226 Difference]: Without dead ends: 46 [2022-07-23 05:34:53,058 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:53,058 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:53,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-23 05:34:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-07-23 05:34:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-07-23 05:34:53,062 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2022-07-23 05:34:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:53,062 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-23 05:34:53,063 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:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-07-23 05:34:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:34:53,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:53,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:53,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:34:53,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 629680340, now seen corresponding path program 1 times [2022-07-23 05:34:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:53,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912814088] [2022-07-23 05:34:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:53,116 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:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912814088] [2022-07-23 05:34:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912814088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:53,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:53,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:53,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051759816] [2022-07-23 05:34:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:53,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:34:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:53,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:34:53,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:34:53,119 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:53,160 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-23 05:34:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:34:53,160 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:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:53,161 INFO L225 Difference]: With dead ends: 36 [2022-07-23 05:34:53,161 INFO L226 Difference]: Without dead ends: 36 [2022-07-23 05:34:53,161 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:53,162 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:53,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-23 05:34:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-23 05:34:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-23 05:34:53,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2022-07-23 05:34:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:53,171 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-23 05:34:53,171 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:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-23 05:34:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:53,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:53,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:53,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:34:53,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745921, now seen corresponding path program 1 times [2022-07-23 05:34:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:53,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747318177] [2022-07-23 05:34:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:53,236 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:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747318177] [2022-07-23 05:34:53,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747318177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:53,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:53,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:34:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056444768] [2022-07-23 05:34:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:53,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:34:53,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:53,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:34:53,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:34:53,238 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:53,285 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-23 05:34:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:34:53,287 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:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:53,287 INFO L225 Difference]: With dead ends: 35 [2022-07-23 05:34:53,288 INFO L226 Difference]: Without dead ends: 35 [2022-07-23 05:34:53,289 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:53,292 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:53,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-23 05:34:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-23 05:34:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-23 05:34:53,301 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-07-23 05:34:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:53,302 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-23 05:34:53,302 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:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-07-23 05:34:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:53,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:53,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:34:53,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:53,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745920, now seen corresponding path program 1 times [2022-07-23 05:34:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:53,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056350017] [2022-07-23 05:34:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:34:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056350017] [2022-07-23 05:34:53,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056350017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:53,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:53,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:34:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817793022] [2022-07-23 05:34:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:34:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:53,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:34:53,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:34:53,422 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:53,473 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-23 05:34:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:34:53,473 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:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:53,474 INFO L225 Difference]: With dead ends: 41 [2022-07-23 05:34:53,474 INFO L226 Difference]: Without dead ends: 41 [2022-07-23 05:34:53,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:34:53,475 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:53,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-23 05:34:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-07-23 05:34:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-23 05:34:53,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2022-07-23 05:34:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:53,479 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-23 05:34:53,479 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:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-23 05:34:53,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:34:53,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:53,480 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:53,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:34:53,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:53,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-23 05:34:53,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:53,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358661658] [2022-07-23 05:34:53,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:53,536 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:53,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:53,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358661658] [2022-07-23 05:34:53,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358661658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:53,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842891580] [2022-07-23 05:34:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:53,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:53,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:53,543 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:53,571 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:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:53,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:34:53,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:53,695 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:34:53,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:34:53,752 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:53,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:53,870 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:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842891580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:53,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:53,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-23 05:34:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343341365] [2022-07-23 05:34:53,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:53,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:34:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:34:53,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:34:53,873 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:54,024 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-07-23 05:34:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:34:54,024 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:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:54,025 INFO L225 Difference]: With dead ends: 80 [2022-07-23 05:34:54,025 INFO L226 Difference]: Without dead ends: 80 [2022-07-23 05:34:54,025 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:54,026 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:54,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-23 05:34:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2022-07-23 05:34:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-23 05:34:54,029 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2022-07-23 05:34:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:54,030 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-23 05:34:54,030 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:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-23 05:34:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:34:54,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:54,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:54,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 05:34:54,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:54,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -467610218, now seen corresponding path program 1 times [2022-07-23 05:34:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:54,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851581323] [2022-07-23 05:34:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:54,270 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:54,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:54,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851581323] [2022-07-23 05:34:54,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851581323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:54,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:54,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:34:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091701045] [2022-07-23 05:34:54,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:54,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:54,273 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:54,287 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-23 05:34:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:54,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:34:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:54,288 INFO L225 Difference]: With dead ends: 33 [2022-07-23 05:34:54,288 INFO L226 Difference]: Without dead ends: 33 [2022-07-23 05:34:54,288 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:54,289 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:54,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-23 05:34:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-23 05:34:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-23 05:34:54,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2022-07-23 05:34:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:54,292 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-23 05:34:54,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-23 05:34:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:34:54,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:54,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:54,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:34:54,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1625875758, now seen corresponding path program 1 times [2022-07-23 05:34:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:54,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240481548] [2022-07-23 05:34:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:54,345 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:54,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:54,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240481548] [2022-07-23 05:34:54,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240481548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:54,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:54,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:34:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489675089] [2022-07-23 05:34:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:54,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:34:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:34:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:34:54,348 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:54,381 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-07-23 05:34:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:34:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 05:34:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:54,382 INFO L225 Difference]: With dead ends: 61 [2022-07-23 05:34:54,382 INFO L226 Difference]: Without dead ends: 61 [2022-07-23 05:34:54,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:34:54,383 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:54,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-23 05:34:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-07-23 05:34:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-23 05:34:54,387 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 14 [2022-07-23 05:34:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:54,388 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-23 05:34:54,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-23 05:34:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:34:54,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:54,389 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:54,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:34:54,389 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1968026960, now seen corresponding path program 1 times [2022-07-23 05:34:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:54,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510608558] [2022-07-23 05:34:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:54,472 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:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510608558] [2022-07-23 05:34:54,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510608558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:54,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:54,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:34:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700068694] [2022-07-23 05:34:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:54,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:34:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:54,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:34:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:34:54,475 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:54,565 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-07-23 05:34:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:34:54,566 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:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:54,567 INFO L225 Difference]: With dead ends: 69 [2022-07-23 05:34:54,567 INFO L226 Difference]: Without dead ends: 69 [2022-07-23 05:34:54,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:34:54,568 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:54,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-23 05:34:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-23 05:34:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-23 05:34:54,574 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 14 [2022-07-23 05:34:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:54,575 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-23 05:34:54,575 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:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-23 05:34:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:34:54,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:54,578 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:54,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:34:54,579 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1709861522, now seen corresponding path program 1 times [2022-07-23 05:34:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:54,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076767956] [2022-07-23 05:34:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:54,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:54,689 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:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:54,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076767956] [2022-07-23 05:34:54,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076767956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:54,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:54,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:34:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499046288] [2022-07-23 05:34:54,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:54,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:34:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:54,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:34:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:34:54,692 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:54,934 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-23 05:34:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:34:54,935 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:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:54,936 INFO L225 Difference]: With dead ends: 81 [2022-07-23 05:34:54,937 INFO L226 Difference]: Without dead ends: 81 [2022-07-23 05:34:54,937 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:54,937 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:54,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 146 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-23 05:34:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-07-23 05:34:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-07-23 05:34:54,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2022-07-23 05:34:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:54,941 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-07-23 05:34:54,942 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:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-07-23 05:34:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:34:54,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:54,942 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:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:34:54,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011067, now seen corresponding path program 1 times [2022-07-23 05:34:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678633945] [2022-07-23 05:34:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:54,995 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:54,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678633945] [2022-07-23 05:34:54,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678633945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:54,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:54,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:34:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312985479] [2022-07-23 05:34:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:54,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:34:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:54,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:34:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:34:54,998 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:55,051 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-07-23 05:34:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:34:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 05:34:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:55,053 INFO L225 Difference]: With dead ends: 54 [2022-07-23 05:34:55,053 INFO L226 Difference]: Without dead ends: 54 [2022-07-23 05:34:55,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:34:55,054 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:55,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-23 05:34:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-23 05:34:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-07-23 05:34:55,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2022-07-23 05:34:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:55,057 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-07-23 05:34:55,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-07-23 05:34:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:34:55,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:55,058 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:55,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:34:55,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011066, now seen corresponding path program 1 times [2022-07-23 05:34:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:55,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345886265] [2022-07-23 05:34:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:55,119 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:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:55,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345886265] [2022-07-23 05:34:55,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345886265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:55,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:55,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:34:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062284371] [2022-07-23 05:34:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:34:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:34:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:34:55,121 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:55,186 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-07-23 05:34:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:34:55,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 05:34:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:55,187 INFO L225 Difference]: With dead ends: 66 [2022-07-23 05:34:55,187 INFO L226 Difference]: Without dead ends: 66 [2022-07-23 05:34:55,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:34:55,188 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:55,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-23 05:34:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-07-23 05:34:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-23 05:34:55,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2022-07-23 05:34:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:55,192 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-23 05:34:55,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-23 05:34:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:34:55,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:55,193 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:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:34:55,193 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -879845628, now seen corresponding path program 1 times [2022-07-23 05:34:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:55,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817017343] [2022-07-23 05:34:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:55,335 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:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:55,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817017343] [2022-07-23 05:34:55,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817017343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:55,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:55,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 05:34:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794699392] [2022-07-23 05:34:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:55,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:34:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:34:55,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:34:55,338 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:55,517 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-23 05:34:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:34:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 05:34:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:55,519 INFO L225 Difference]: With dead ends: 67 [2022-07-23 05:34:55,519 INFO L226 Difference]: Without dead ends: 67 [2022-07-23 05:34:55,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-23 05:34:55,519 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:55,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-23 05:34:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-23 05:34:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-23 05:34:55,522 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 15 [2022-07-23 05:34:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:55,522 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-23 05:34:55,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-23 05:34:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:34:55,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:55,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:34:55,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:34:55,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1587978612, now seen corresponding path program 1 times [2022-07-23 05:34:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:55,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930012415] [2022-07-23 05:34:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:55,588 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:55,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:55,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930012415] [2022-07-23 05:34:55,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930012415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:34:55,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:34:55,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:34:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800734155] [2022-07-23 05:34:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:34:55,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:34:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:34:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:34:55,591 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:55,605 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-23 05:34:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:34:55,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:34:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:55,606 INFO L225 Difference]: With dead ends: 64 [2022-07-23 05:34:55,606 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 05:34:55,607 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:55,607 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:55,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:34:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 05:34:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-23 05:34:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-23 05:34:55,610 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2022-07-23 05:34:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:55,611 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-23 05:34:55,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-23 05:34:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:34:55,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:55,612 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:55,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 05:34:55,612 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash 980027851, now seen corresponding path program 1 times [2022-07-23 05:34:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912486261] [2022-07-23 05:34:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:55,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:55,713 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:55,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:55,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912486261] [2022-07-23 05:34:55,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912486261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:55,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563005586] [2022-07-23 05:34:55,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:55,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:55,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:55,715 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:55,742 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:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:55,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 05:34:55,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:55,885 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:55,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:56,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 05:34:56,030 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:56,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563005586] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:56,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:56,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-23 05:34:56,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633150436] [2022-07-23 05:34:56,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:56,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 05:34:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 05:34:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-23 05:34:56,033 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:56,305 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-23 05:34:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:34:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:34:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:56,307 INFO L225 Difference]: With dead ends: 63 [2022-07-23 05:34:56,307 INFO L226 Difference]: Without dead ends: 63 [2022-07-23 05:34:56,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-23 05:34:56,308 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:56,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 122 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-23 05:34:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-07-23 05:34:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-23 05:34:56,310 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2022-07-23 05:34:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:56,310 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-23 05:34:56,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-23 05:34:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:34:56,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:56,310 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:56,335 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:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 05:34:56,511 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 358816956, now seen corresponding path program 1 times [2022-07-23 05:34:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:56,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210709243] [2022-07-23 05:34:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:56,735 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:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:56,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210709243] [2022-07-23 05:34:56,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210709243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:56,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864095482] [2022-07-23 05:34:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:56,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:56,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:56,739 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:56,741 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:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:56,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-23 05:34:56,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:56,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:56,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-23 05:34:56,849 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:57,187 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:57,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:57,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:34:57,588 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:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864095482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:57,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:57,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-23 05:34:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366478093] [2022-07-23 05:34:57,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:57,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 05:34:57,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:57,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 05:34:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-07-23 05:34:57,591 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:59,122 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-23 05:34:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:34:59,123 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-23 05:34:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:59,123 INFO L225 Difference]: With dead ends: 53 [2022-07-23 05:34:59,123 INFO L226 Difference]: Without dead ends: 24 [2022-07-23 05:34:59,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 05:34:59,125 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:59,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 226 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:34:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-23 05:34:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-23 05:34:59,126 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:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-23 05:34:59,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2022-07-23 05:34:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:59,127 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-23 05:34:59,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-23 05:34:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:34:59,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:59,128 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:59,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-23 05:34:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:59,353 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:34:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:34:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 316092298, now seen corresponding path program 1 times [2022-07-23 05:34:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:34:59,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23843078] [2022-07-23 05:34:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:34:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:34:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:34:59,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23843078] [2022-07-23 05:34:59,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23843078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:34:59,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497502681] [2022-07-23 05:34:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:34:59,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:34:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:34:59,436 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:59,467 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:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:34:59,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 05:34:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:34:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:34:59,523 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:59,527 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:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:34:59,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:34:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:34:59,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497502681] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:34:59,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:34:59,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-23 05:34:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616960997] [2022-07-23 05:34:59,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:34:59,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 05:34:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:34:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 05:34:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:34:59,811 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:34:59,965 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-23 05:34:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:34:59,965 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-23 05:34:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:34:59,965 INFO L225 Difference]: With dead ends: 25 [2022-07-23 05:34:59,966 INFO L226 Difference]: Without dead ends: 25 [2022-07-23 05:34:59,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-07-23 05:34:59,966 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:34:59,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:34:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-23 05:34:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-23 05:34:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-23 05:34:59,968 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-07-23 05:34:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:34:59,968 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-23 05:34:59,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:34:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-23 05:34:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:34:59,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:34:59,969 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:35:00,003 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:35:00,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:00,170 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2137348900, now seen corresponding path program 2 times [2022-07-23 05:35:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:00,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445856175] [2022-07-23 05:35:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:00,352 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:35:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:00,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445856175] [2022-07-23 05:35:00,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445856175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:00,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377160180] [2022-07-23 05:35:00,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:35:00,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:00,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:00,354 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:35:00,381 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:35:00,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:35:00,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:00,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:35:00,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:00,447 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:00,495 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:00,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 17 treesize of output 19 [2022-07-23 05:35:00,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:00,789 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:35:00,904 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:35:00,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:01,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-23 05:35:01,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)))) is different from false [2022-07-23 05:35:01,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:01,218 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:01,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:01,227 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:01,232 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:35:01,237 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:01,342 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:35:01,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377160180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:01,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:01,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-23 05:35:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150056653] [2022-07-23 05:35:01,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:01,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 05:35:01,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:01,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 05:35:01,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=952, Unknown=2, NotChecked=126, Total=1190 [2022-07-23 05:35:01,345 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:01,887 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-23 05:35:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:35:01,888 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:35:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:01,888 INFO L225 Difference]: With dead ends: 46 [2022-07-23 05:35:01,888 INFO L226 Difference]: Without dead ends: 36 [2022-07-23 05:35:01,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=1783, Unknown=2, NotChecked=174, Total=2162 [2022-07-23 05:35:01,891 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:01,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 122 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-07-23 05:35:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-23 05:35:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-23 05:35:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-23 05:35:01,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2022-07-23 05:35:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:01,892 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-23 05:35:01,893 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:35:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-23 05:35:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 05:35:01,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:01,894 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:35:01,921 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:35:02,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:02,104 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 269887706, now seen corresponding path program 3 times [2022-07-23 05:35:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:02,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441389546] [2022-07-23 05:35:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:02,361 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:35:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:02,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441389546] [2022-07-23 05:35:02,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441389546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:02,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813936651] [2022-07-23 05:35:02,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:35:02,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:02,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:02,364 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:35:02,386 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:35:02,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:35:02,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:02,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-23 05:35:02,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:02,479 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:02,593 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:02,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:02,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:02,754 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:02,757 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:35:02,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:02,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:35:02,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:02,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:02,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:02,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:02,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:02,801 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:02,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:02,807 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:02,810 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:02,970 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:35:02,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813936651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:02,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:02,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2022-07-23 05:35:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993081319] [2022-07-23 05:35:02,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:02,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-23 05:35:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-23 05:35:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2022-07-23 05:35:02,973 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:03,348 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-23 05:35:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:35:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-23 05:35:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:03,351 INFO L225 Difference]: With dead ends: 52 [2022-07-23 05:35:03,351 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 05:35:03,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1063, Unknown=5, NotChecked=350, Total=1560 [2022-07-23 05:35:03,352 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:03,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-07-23 05:35:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 05:35:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-23 05:35:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-23 05:35:03,353 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-07-23 05:35:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:03,354 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-23 05:35:03,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-23 05:35:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:35:03,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:03,354 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:35:03,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 05:35:03,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:03,564 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:03,564 INFO L85 PathProgramCache]: Analyzing trace with hash -826784969, now seen corresponding path program 4 times [2022-07-23 05:35:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:03,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414697258] [2022-07-23 05:35:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:03,708 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:35:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414697258] [2022-07-23 05:35:03,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414697258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674318906] [2022-07-23 05:35:03,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:35:03,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:03,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:03,711 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:35:03,712 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:35:03,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:35:03,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:03,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-23 05:35:03,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:03,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:35:03,813 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:35:03,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 05:35:04,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:35:04,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:04,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:04,231 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:35:04,320 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:35:04,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:04,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:04,774 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:04,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:04,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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:04,785 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:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:05,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674318906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:05,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:05,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2022-07-23 05:35:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807608568] [2022-07-23 05:35:05,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:05,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 05:35:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 05:35:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1518, Unknown=1, NotChecked=0, Total=1722 [2022-07-23 05:35:05,029 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:05,923 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-23 05:35:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 05:35:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 05:35:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:05,924 INFO L225 Difference]: With dead ends: 43 [2022-07-23 05:35:05,924 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 05:35:05,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=493, Invalid=2926, Unknown=3, NotChecked=0, Total=3422 [2022-07-23 05:35:05,931 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:05,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 165 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 348 Invalid, 0 Unknown, 120 Unchecked, 0.2s Time] [2022-07-23 05:35:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 05:35:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-23 05:35:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-23 05:35:05,934 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-23 05:35:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:05,935 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-23 05:35:05,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-23 05:35:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:35:05,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:05,936 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:05,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-23 05:35:06,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:06,148 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2031773033, now seen corresponding path program 5 times [2022-07-23 05:35:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:06,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243987093] [2022-07-23 05:35:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:06,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243987093] [2022-07-23 05:35:06,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243987093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:06,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63037942] [2022-07-23 05:35:06,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:35:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:06,308 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:35:06,309 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:35:06,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-23 05:35:06,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:06,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 05:35:06,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:06,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:35:06,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:35:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:06,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:06,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63037942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:06,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-07-23 05:35:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148144418] [2022-07-23 05:35:06,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 05:35:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 05:35:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-07-23 05:35:06,932 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:07,322 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-23 05:35:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:35:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 05:35:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:07,323 INFO L225 Difference]: With dead ends: 70 [2022-07-23 05:35:07,323 INFO L226 Difference]: Without dead ends: 50 [2022-07-23 05:35:07,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-07-23 05:35:07,324 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:07,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 101 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:35:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-23 05:35:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-23 05:35:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-23 05:35:07,326 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-07-23 05:35:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:07,326 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-23 05:35:07,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-23 05:35:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 05:35:07,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:07,327 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:07,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 05:35:07,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 05:35:07,547 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:07,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1224662086, now seen corresponding path program 6 times [2022-07-23 05:35:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:07,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185178249] [2022-07-23 05:35:07,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:08,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:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:08,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185178249] [2022-07-23 05:35:08,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185178249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:08,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090683812] [2022-07-23 05:35:08,011 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:35:08,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:08,020 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:35:08,021 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:35:08,142 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-23 05:35:08,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:08,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-23 05:35:08,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:08,155 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:08,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:35:08,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:08,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:08,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:08,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:35:08,664 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:08,667 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:08,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:08,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:35:08,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)))) is different from false [2022-07-23 05:35:08,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_434) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:08,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:08,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_433) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:08,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:08,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_432) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:08,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:08,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:35:08,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:08,742 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:08,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:08,750 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:08,754 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:09,003 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:09,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090683812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:09,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:09,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 50 [2022-07-23 05:35:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827009653] [2022-07-23 05:35:09,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:09,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 05:35:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 05:35:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1525, Unknown=9, NotChecked=774, Total=2450 [2022-07-23 05:35:09,005 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:09,804 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-23 05:35:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 05:35:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-23 05:35:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:09,805 INFO L225 Difference]: With dead ends: 76 [2022-07-23 05:35:09,805 INFO L226 Difference]: Without dead ends: 54 [2022-07-23 05:35:09,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=2464, Unknown=9, NotChecked=972, Total=3660 [2022-07-23 05:35:09,806 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:09,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 396 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 756 Invalid, 0 Unknown, 400 Unchecked, 0.3s Time] [2022-07-23 05:35:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-23 05:35:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-23 05:35:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-23 05:35:09,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-07-23 05:35:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:09,812 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-23 05:35:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-23 05:35:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 05:35:09,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:09,813 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:09,830 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:10,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 05:35:10,014 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash 300063907, now seen corresponding path program 7 times [2022-07-23 05:35:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:10,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635489961] [2022-07-23 05:35:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:10,258 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:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635489961] [2022-07-23 05:35:10,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635489961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675186010] [2022-07-23 05:35:10,259 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:35:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:10,261 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:10,286 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:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:10,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-23 05:35:10,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:10,599 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:10,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:10,834 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:10,874 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:10,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675186010] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:10,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:10,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-23 05:35:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993965496] [2022-07-23 05:35:10,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:10,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 05:35:10,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:10,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 05:35:10,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 05:35:10,876 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:11,331 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-23 05:35:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:35:11,331 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:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:11,332 INFO L225 Difference]: With dead ends: 57 [2022-07-23 05:35:11,332 INFO L226 Difference]: Without dead ends: 57 [2022-07-23 05:35:11,333 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:11,333 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 134 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:11,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 192 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:35:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-23 05:35:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-23 05:35:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-23 05:35:11,335 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-07-23 05:35:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:11,336 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-23 05:35:11,336 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:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-23 05:35:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 05:35:11,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:11,337 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:11,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 05:35:11,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-23 05:35:11,552 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash -265764356, now seen corresponding path program 8 times [2022-07-23 05:35:11,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078842455] [2022-07-23 05:35:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:12,124 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:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078842455] [2022-07-23 05:35:12,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078842455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499929069] [2022-07-23 05:35:12,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:35:12,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:12,126 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:12,126 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:12,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:35:12,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:12,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-23 05:35:12,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:12,238 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:12,457 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:12,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:12,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:12,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:35:13,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:13,473 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:35:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:13,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:14,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-23 05:35:14,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-23 05:35:14,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:14,704 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:14,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:14,711 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:14,718 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:14,721 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:35:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-23 05:35:15,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499929069] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:15,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:15,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 75 [2022-07-23 05:35:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419234793] [2022-07-23 05:35:15,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-23 05:35:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-23 05:35:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4890, Unknown=6, NotChecked=286, Total=5550 [2022-07-23 05:35:15,124 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:16,983 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-23 05:35:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-23 05:35:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-23 05:35:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:16,984 INFO L225 Difference]: With dead ends: 94 [2022-07-23 05:35:16,984 INFO L226 Difference]: Without dead ends: 68 [2022-07-23 05:35:16,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=801, Invalid=9503, Unknown=6, NotChecked=402, Total=10712 [2022-07-23 05:35:16,987 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:16,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 421 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 566 Unchecked, 0.2s Time] [2022-07-23 05:35:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-23 05:35:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-07-23 05:35:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-23 05:35:16,988 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 54 [2022-07-23 05:35:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:16,988 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-23 05:35:16,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-23 05:35:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 05:35:16,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:16,989 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:17,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-23 05:35:17,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-23 05:35:17,190 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1063800910, now seen corresponding path program 9 times [2022-07-23 05:35:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:17,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250760331] [2022-07-23 05:35:17,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:17,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250760331] [2022-07-23 05:35:17,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250760331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:17,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051229298] [2022-07-23 05:35:17,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:35:17,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:17,868 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:17,868 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:18,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-23 05:35:18,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:18,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-23 05:35:18,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:18,190 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:18,365 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:18,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:18,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:35:18,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 14 treesize of output 16 [2022-07-23 05:35:18,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:35:18,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:35:18,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:18,929 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:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:18,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:18,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:35:18,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:18,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_631) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:18,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:18,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_630) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:18,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:18,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_629) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:18,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:18,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_628) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:19,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:19,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_627) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:19,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:19,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:19,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:19,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:35:19,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:19,033 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:19,037 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:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 83 not checked. [2022-07-23 05:35:19,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051229298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:19,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:19,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 69 [2022-07-23 05:35:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612099798] [2022-07-23 05:35:19,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:19,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-23 05:35:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:19,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-23 05:35:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-23 05:35:19,407 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:20,703 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-23 05:35:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 05:35:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-23 05:35:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:20,704 INFO L225 Difference]: With dead ends: 100 [2022-07-23 05:35:20,704 INFO L226 Difference]: Without dead ends: 70 [2022-07-23 05:35:20,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 85 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=288, Invalid=4581, Unknown=13, NotChecked=1924, Total=6806 [2022-07-23 05:35:20,706 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:20,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 573 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1303 Invalid, 0 Unknown, 678 Unchecked, 0.5s Time] [2022-07-23 05:35:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-23 05:35:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-23 05:35:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-07-23 05:35:20,707 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-07-23 05:35:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:20,707 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-07-23 05:35:20,708 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:35:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-07-23 05:35:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 05:35:20,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:20,708 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:20,733 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:20,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-23 05:35:20,909 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash 397481487, now seen corresponding path program 10 times [2022-07-23 05:35:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:20,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526196183] [2022-07-23 05:35:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:20,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:21,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526196183] [2022-07-23 05:35:21,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526196183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:21,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47058055] [2022-07-23 05:35:21,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:35:21,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:21,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:21,217 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:21,217 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:21,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:35:21,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:21,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-23 05:35:21,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:21,344 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:35:21,344 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:35:21,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 10 treesize of output 8 [2022-07-23 05:35:21,683 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:35:21,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:21,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:35:22,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:22,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:22,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:22,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:35:22,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:22,414 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:35:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:22,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:23,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-23 05:35:23,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0))) is different from false [2022-07-23 05:35:23,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:23,556 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:23,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:23,562 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:23,566 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:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-23 05:35:24,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47058055] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:24,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:24,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 28] total 74 [2022-07-23 05:35:24,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536398897] [2022-07-23 05:35:24,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:24,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-23 05:35:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-23 05:35:24,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4717, Unknown=7, NotChecked=286, Total=5550 [2022-07-23 05:35:24,636 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:26,801 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-23 05:35:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-23 05:35:26,803 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-07-23 05:35:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:26,804 INFO L225 Difference]: With dead ends: 75 [2022-07-23 05:35:26,804 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 05:35:26,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1403, Invalid=8463, Unknown=42, NotChecked=394, Total=10302 [2022-07-23 05:35:26,806 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:26,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 940 Invalid, 0 Unknown, 536 Unchecked, 0.4s Time] [2022-07-23 05:35:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 05:35:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-23 05:35:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-23 05:35:26,808 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-23 05:35:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:26,808 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-23 05:35:26,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-23 05:35:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 05:35:26,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:26,809 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:26,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-23 05:35:27,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-23 05:35:27,023 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2032213951, now seen corresponding path program 11 times [2022-07-23 05:35:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:27,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482656606] [2022-07-23 05:35:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 139 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:27,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:27,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482656606] [2022-07-23 05:35:27,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482656606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:27,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439618198] [2022-07-23 05:35:27,341 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:35:27,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:27,344 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:35:27,369 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:35:27,758 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-23 05:35:27,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:27,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-23 05:35:27,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:27,775 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:35:27,775 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:35:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:28,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:28,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439618198] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:28,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:28,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2022-07-23 05:35:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763516665] [2022-07-23 05:35:28,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:28,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 05:35:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 05:35:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2138, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 05:35:28,733 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:29,404 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-07-23 05:35:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:35:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-23 05:35:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:29,405 INFO L225 Difference]: With dead ends: 118 [2022-07-23 05:35:29,405 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 05:35:29,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=894, Invalid=3936, Unknown=0, NotChecked=0, Total=4830 [2022-07-23 05:35:29,407 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:29,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:35:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 05:35:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-23 05:35:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-23 05:35:29,409 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-07-23 05:35:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:29,409 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-23 05:35:29,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-23 05:35:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-23 05:35:29,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:29,409 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:35:29,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-23 05:35:29,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:29,619 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -626482402, now seen corresponding path program 12 times [2022-07-23 05:35:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:29,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932832459] [2022-07-23 05:35:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:30,682 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:35:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932832459] [2022-07-23 05:35:30,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932832459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072440172] [2022-07-23 05:35:30,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:35:30,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:30,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:30,684 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:35:30,708 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:35:31,322 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-23 05:35:31,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:31,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-23 05:35:31,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:31,336 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:31,732 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:31,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31,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 16 treesize of output 18 [2022-07-23 05:35:32,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32,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:35:32,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:35:32,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:35:32,259 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:35:32,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:32,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:35:32,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:32,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_885) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:32,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_884) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_883) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_882) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_881) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_879) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:32,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:32,359 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:32,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:32,365 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:32,368 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:32,701 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:35:32,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072440172] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:32,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:32,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 80 [2022-07-23 05:35:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180324145] [2022-07-23 05:35:32,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:32,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-23 05:35:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-23 05:35:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3735, Unknown=17, NotChecked=2346, Total=6320 [2022-07-23 05:35:32,703 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:34,473 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2022-07-23 05:35:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-23 05:35:34,474 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-23 05:35:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:34,474 INFO L225 Difference]: With dead ends: 124 [2022-07-23 05:35:34,474 INFO L226 Difference]: Without dead ends: 86 [2022-07-23 05:35:34,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=353, Invalid=6504, Unknown=17, NotChecked=3026, Total=9900 [2022-07-23 05:35:34,476 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:34,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 808 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1731 Invalid, 0 Unknown, 1153 Unchecked, 0.6s Time] [2022-07-23 05:35:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-23 05:35:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-23 05:35:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-07-23 05:35:34,478 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-07-23 05:35:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:34,478 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-07-23 05:35:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-07-23 05:35:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 05:35:34,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:34,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:35:34,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-23 05:35:34,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:34,687 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash -605311109, now seen corresponding path program 13 times [2022-07-23 05:35:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:34,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533139642] [2022-07-23 05:35:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:34,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:35,123 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:35:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:35,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533139642] [2022-07-23 05:35:35,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533139642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:35,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135994091] [2022-07-23 05:35:35,124 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:35:35,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:35,126 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:35:35,153 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:35:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:35,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-23 05:35:35,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:35,660 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:35:35,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:36,064 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:36,114 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:35:36,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135994091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:36,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:36,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 50 [2022-07-23 05:35:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757583852] [2022-07-23 05:35:36,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:36,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 05:35:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 05:35:36,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 05:35:36,116 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:37,023 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-23 05:35:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-23 05:35:37,024 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-07-23 05:35:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:37,024 INFO L225 Difference]: With dead ends: 89 [2022-07-23 05:35:37,024 INFO L226 Difference]: Without dead ends: 89 [2022-07-23 05:35:37,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2022-07-23 05:35:37,025 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 381 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:37,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 364 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:35:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-23 05:35:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-23 05:35:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-23 05:35:37,028 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-07-23 05:35:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:37,028 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-23 05:35:37,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-23 05:35:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-23 05:35:37,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:37,029 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:35:37,056 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:35:37,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:37,232 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1757632300, now seen corresponding path program 14 times [2022-07-23 05:35:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:37,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82525614] [2022-07-23 05:35:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:38,343 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:35:38,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:38,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82525614] [2022-07-23 05:35:38,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82525614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:38,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052342943] [2022-07-23 05:35:38,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:35:38,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:38,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:38,346 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:35:38,347 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:35:38,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:35:38,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:38,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 169 conjunts are in the unsatisfiable core [2022-07-23 05:35:38,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:38,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:35:38,969 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:39,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:39,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:39,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:35:39,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:39,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:35:40,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:35:40,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:40,759 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:35:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:40,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:41,652 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1072) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) (and (<= 0 (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-23 05:35:42,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-23 05:35:42,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|))) is different from false [2022-07-23 05:35:42,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:42,872 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:42,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:42,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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:42,883 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:42,889 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:35:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-23 05:35:43,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052342943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:43,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:43,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 115 [2022-07-23 05:35:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653480510] [2022-07-23 05:35:43,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:43,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-07-23 05:35:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:43,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-07-23 05:35:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=11682, Unknown=11, NotChecked=666, Total=13110 [2022-07-23 05:35:43,730 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:50,250 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-23 05:35:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-07-23 05:35:50,251 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-23 05:35:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:50,251 INFO L225 Difference]: With dead ends: 142 [2022-07-23 05:35:50,251 INFO L226 Difference]: Without dead ends: 100 [2022-07-23 05:35:50,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 160 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 5020 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1637, Invalid=23486, Unknown=11, NotChecked=948, Total=26082 [2022-07-23 05:35:50,253 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:50,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 766 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 793 Invalid, 0 Unknown, 1165 Unchecked, 0.3s Time] [2022-07-23 05:35:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-23 05:35:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-07-23 05:35:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-23 05:35:50,256 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2022-07-23 05:35:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:50,256 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-23 05:35:50,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-23 05:35:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 05:35:50,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:50,257 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:50,280 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:35:50,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:50,471 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash -486951286, now seen corresponding path program 15 times [2022-07-23 05:35:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:50,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397398612] [2022-07-23 05:35:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:51,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397398612] [2022-07-23 05:35:51,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397398612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:51,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064999645] [2022-07-23 05:35:51,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:35:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:51,718 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:35:51,718 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:35:53,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-23 05:35:53,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:53,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 188 conjunts are in the unsatisfiable core [2022-07-23 05:35:53,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:53,492 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:54,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:54,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:35:54,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54,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:54,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:35:54,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:35:54,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:35:54,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 14 treesize of output 16 [2022-07-23 05:35:54,739 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:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:54,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:35:54,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:35:54,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:54,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1184) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:35:54,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1183) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1182) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:35:54,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1181) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1180) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1179) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1178) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:35:54,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:35:54,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:35:54,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:54,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:35:54,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:35:54,891 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:54,895 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,208 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 219 not checked. [2022-07-23 05:35:55,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064999645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:35:55,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:35:55,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 39, 39] total 96 [2022-07-23 05:35:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429099762] [2022-07-23 05:35:55,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:35:55,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-23 05:35:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:35:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-23 05:35:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5347, Unknown=21, NotChecked=3486, Total=9120 [2022-07-23 05:35:55,210 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:35:58,038 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2022-07-23 05:35:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-23 05:35:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-23 05:35:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:35:58,039 INFO L225 Difference]: With dead ends: 148 [2022-07-23 05:35:58,039 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 05:35:58,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 137 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=398, Invalid=8977, Unknown=21, NotChecked=4410, Total=13806 [2022-07-23 05:35:58,040 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1734 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:35:58,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1123 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2747 Invalid, 0 Unknown, 1734 Unchecked, 1.0s Time] [2022-07-23 05:35:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 05:35:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-23 05:35:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-07-23 05:35:58,042 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-07-23 05:35:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:35:58,044 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-07-23 05:35:58,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:35:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-07-23 05:35:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-23 05:35:58,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:35:58,045 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:35:58,069 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:35:58,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:58,259 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:35:58,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:35:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1113221351, now seen corresponding path program 16 times [2022-07-23 05:35:58,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:35:58,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975859337] [2022-07-23 05:35:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:35:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:35:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:35:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 153 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:35:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:35:58,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975859337] [2022-07-23 05:35:58,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975859337] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:35:58,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366474889] [2022-07-23 05:35:58,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:35:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:35:58,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:35:58,792 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:35:58,802 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:35:59,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:35:59,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:35:59,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 192 conjunts are in the unsatisfiable core [2022-07-23 05:35:59,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:35:59,039 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:35:59,040 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:35:59,045 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,622 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:35:59,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:59,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:36:00,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:36:00,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,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 18 treesize of output 20 [2022-07-23 05:36:00,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 18 treesize of output 20 [2022-07-23 05:36:01,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:01,023 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:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 200 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:01,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:03,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-23 05:36:03,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-23 05:36:03,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:03,251 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:03,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:03,257 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:03,261 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,194 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-23 05:36:05,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366474889] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:05,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:05,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 40, 40] total 106 [2022-07-23 05:36:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483386612] [2022-07-23 05:36:05,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:05,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-07-23 05:36:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-07-23 05:36:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=9837, Unknown=12, NotChecked=414, Total=11342 [2022-07-23 05:36:05,197 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:09,345 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-23 05:36:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-23 05:36:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-23 05:36:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:09,346 INFO L225 Difference]: With dead ends: 107 [2022-07-23 05:36:09,346 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 05:36:09,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 120 SyntacticMatches, 10 SemanticMatches, 144 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3801 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2975, Invalid=17553, Unknown=72, NotChecked=570, Total=21170 [2022-07-23 05:36:09,347 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 371 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:09,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 746 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1258 Invalid, 0 Unknown, 543 Unchecked, 0.6s Time] [2022-07-23 05:36:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 05:36:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-23 05:36:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-07-23 05:36:09,350 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 98 [2022-07-23 05:36:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:09,350 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-07-23 05:36:09,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-07-23 05:36:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 05:36:09,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:09,352 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:09,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-23 05:36:09,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:09,579 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:36:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash -36447463, now seen corresponding path program 17 times [2022-07-23 05:36:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:09,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57616291] [2022-07-23 05:36:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 303 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:10,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57616291] [2022-07-23 05:36:10,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57616291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:10,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957776642] [2022-07-23 05:36:10,132 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:36:10,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:10,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:10,134 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:10,135 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:12,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-23 05:36:12,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:12,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-23 05:36:12,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:12,597 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:36:12,597 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:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:13,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:14,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957776642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:14,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:14,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 72 [2022-07-23 05:36:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247816465] [2022-07-23 05:36:14,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:14,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-23 05:36:14,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:14,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-23 05:36:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=4233, Unknown=0, NotChecked=0, Total=5112 [2022-07-23 05:36:14,316 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:14,989 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2022-07-23 05:36:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 05:36:14,989 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-23 05:36:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:14,990 INFO L225 Difference]: With dead ends: 166 [2022-07-23 05:36:14,990 INFO L226 Difference]: Without dead ends: 114 [2022-07-23 05:36:14,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1509, Invalid=6147, Unknown=0, NotChecked=0, Total=7656 [2022-07-23 05:36:14,991 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 140 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:14,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 238 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:36:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-23 05:36:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-07-23 05:36:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-07-23 05:36:14,994 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-07-23 05:36:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:14,994 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-07-23 05:36:14,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-07-23 05:36:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 05:36:14,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:14,995 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:36:15,018 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:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-23 05:36:15,200 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:36:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 223537654, now seen corresponding path program 18 times [2022-07-23 05:36:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:15,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387007683] [2022-07-23 05:36:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:16,892 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:36:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387007683] [2022-07-23 05:36:16,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387007683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:16,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777898567] [2022-07-23 05:36:16,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:36:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:16,895 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:16,896 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:20,726 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-23 05:36:20,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:20,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 290 conjunts are in the unsatisfiable core [2022-07-23 05:36:20,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:20,752 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:21,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-23 05:36:21,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:23,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:23,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:23,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:23,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:23,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 16 treesize of output 18 [2022-07-23 05:36:23,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:36:23,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:23,961 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:23,965 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:36:23,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:23,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:36:23,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:36:23,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1543) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:36:23,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1542) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1541) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1540) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:36:24,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1539) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1538) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1537) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:36:24,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1536) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:36:24,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1535) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:36:24,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1534) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:36:24,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:36:24,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1533) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:36:24,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:36:24,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:24,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:36:24,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:24,146 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:24,149 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:25,125 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:36:25,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777898567] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:25,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:25,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 139 [2022-07-23 05:36:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466557674] [2022-07-23 05:36:25,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:25,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-23 05:36:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-23 05:36:25,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=12535, Unknown=25, NotChecked=6200, Total=19182 [2022-07-23 05:36:25,128 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:28,423 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-07-23 05:36:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-23 05:36:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-23 05:36:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:28,425 INFO L225 Difference]: With dead ends: 172 [2022-07-23 05:36:28,425 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 05:36:28,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 170 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 6613 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=654, Invalid=20883, Unknown=25, NotChecked=7850, Total=29412 [2022-07-23 05:36:28,427 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 4554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2628 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:28,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1638 Invalid, 4554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1910 Invalid, 0 Unknown, 2628 Unchecked, 0.7s Time] [2022-07-23 05:36:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 05:36:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-07-23 05:36:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-23 05:36:28,430 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-07-23 05:36:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:28,431 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-23 05:36:28,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-23 05:36:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 05:36:28,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:28,432 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:36:28,467 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:28,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-23 05:36:28,655 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:36:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash 382026323, now seen corresponding path program 19 times [2022-07-23 05:36:28,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:28,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813525311] [2022-07-23 05:36:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:29,286 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:36:29,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:29,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813525311] [2022-07-23 05:36:29,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813525311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:29,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313019812] [2022-07-23 05:36:29,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:36:29,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:29,288 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:29,289 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:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:29,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-23 05:36:29,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:30,113 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:36:30,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:30,823 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:36:30,896 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:36:30,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313019812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:30,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:30,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 65 [2022-07-23 05:36:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123726022] [2022-07-23 05:36:30,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:30,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-23 05:36:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:30,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-23 05:36:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3886, Unknown=0, NotChecked=0, Total=4290 [2022-07-23 05:36:30,898 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:32,906 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-07-23 05:36:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-23 05:36:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-23 05:36:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:32,906 INFO L225 Difference]: With dead ends: 121 [2022-07-23 05:36:32,906 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 05:36:32,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2253, Invalid=9303, Unknown=0, NotChecked=0, Total=11556 [2022-07-23 05:36:32,907 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 588 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:32,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 626 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 05:36:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 05:36:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-23 05:36:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-23 05:36:32,910 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-23 05:36:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:32,911 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-23 05:36:32,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-23 05:36:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-23 05:36:32,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:32,912 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:36:32,931 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:33,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-23 05:36:33,115 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:36:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -757002324, now seen corresponding path program 20 times [2022-07-23 05:36:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:33,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507930417] [2022-07-23 05:36:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:34,967 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:36:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:34,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507930417] [2022-07-23 05:36:34,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507930417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531237945] [2022-07-23 05:36:34,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:36:34,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:34,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:34,969 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:34,970 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:35,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:36:35,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:36:35,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 227 conjunts are in the unsatisfiable core [2022-07-23 05:36:35,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:36:35,183 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,864 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:36,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 17 treesize of output 19 [2022-07-23 05:36:36,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:36:36,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:36,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:36,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 17 treesize of output 19 [2022-07-23 05:36:37,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:36:38,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:38,974 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:36:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:39,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:36:41,342 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1801 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) (and (<= 0 (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-23 05:36:42,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:36:42,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0))) is different from false [2022-07-23 05:36:42,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:42,625 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,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:36:42,632 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,636 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:36:42,639 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:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 401 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2022-07-23 05:36:44,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531237945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:36:44,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:36:44,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 155 [2022-07-23 05:36:44,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101746183] [2022-07-23 05:36:44,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:36:44,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-07-23 05:36:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:36:44,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-07-23 05:36:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=21653, Unknown=16, NotChecked=906, Total=23870 [2022-07-23 05:36:44,148 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:36:54,364 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-23 05:36:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-07-23 05:36:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-23 05:36:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:36:54,365 INFO L225 Difference]: With dead ends: 190 [2022-07-23 05:36:54,365 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 05:36:54,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 9556 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=2845, Invalid=44023, Unknown=16, NotChecked=1296, Total=48180 [2022-07-23 05:36:54,367 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 243 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1978 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:36:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1544 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1513 Invalid, 0 Unknown, 1978 Unchecked, 0.6s Time] [2022-07-23 05:36:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 05:36:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-23 05:36:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-07-23 05:36:54,371 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2022-07-23 05:36:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:36:54,372 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-07-23 05:36:54,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:36:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-07-23 05:36:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 05:36:54,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:36:54,373 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:36:54,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-23 05:36:54,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:54,591 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:36:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:36:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1971076450, now seen corresponding path program 21 times [2022-07-23 05:36:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:36:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794637176] [2022-07-23 05:36:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:36:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:36:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:36:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:36:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:36:56,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794637176] [2022-07-23 05:36:56,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794637176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:36:56,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75363485] [2022-07-23 05:36:56,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:36:56,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:36:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:36:56,707 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:56,708 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:37:03,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-23 05:37:03,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:03,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 328 conjunts are in the unsatisfiable core [2022-07-23 05:37:03,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:03,413 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:04,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:04,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:04,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:05,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:05,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:05,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 16 treesize of output 18 [2022-07-23 05:37:05,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:05,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:06,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:06,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:37:06,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:06,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:06,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:37:06,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:07,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:07,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:37:07,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:07,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-23 05:37:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:07,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:07,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:37:07,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:37:07,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1947) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:37:07,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1946) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1945) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1944) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1943) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1942) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1941 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1941) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1940) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:37:07,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1939) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:37:07,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1938) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:37:07,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:37:07,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1937) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:37:07,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1936) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1935) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:37:07,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:07,533 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:07,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:07,538 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:07,541 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:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 419 not checked. [2022-07-23 05:37:08,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75363485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:08,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:08,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 51, 51] total 159 [2022-07-23 05:37:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873700101] [2022-07-23 05:37:08,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:08,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-07-23 05:37:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-07-23 05:37:08,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=16375, Unknown=29, NotChecked=8236, Total=25122 [2022-07-23 05:37:08,769 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:13,328 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2022-07-23 05:37:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-23 05:37:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-07-23 05:37:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:13,329 INFO L225 Difference]: With dead ends: 196 [2022-07-23 05:37:13,329 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 05:37:13,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 158 SyntacticMatches, 15 SemanticMatches, 199 ConstructedPredicates, 29 IntricatePredicates, 13 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=775, Invalid=28724, Unknown=29, NotChecked=10672, Total=40200 [2022-07-23 05:37:13,330 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 5485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2972 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:13,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 2139 Invalid, 5485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2496 Invalid, 0 Unknown, 2972 Unchecked, 0.9s Time] [2022-07-23 05:37:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 05:37:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-07-23 05:37:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-07-23 05:37:13,336 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-07-23 05:37:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:13,336 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-07-23 05:37:13,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-07-23 05:37:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-23 05:37:13,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:13,337 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:13,375 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:37:13,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-23 05:37:13,551 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:37:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 217332671, now seen corresponding path program 22 times [2022-07-23 05:37:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:13,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720734744] [2022-07-23 05:37:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 325 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720734744] [2022-07-23 05:37:14,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720734744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173342329] [2022-07-23 05:37:14,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:37:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:14,272 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:37:14,273 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:37:14,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:37:14,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:14,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 248 conjunts are in the unsatisfiable core [2022-07-23 05:37:14,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:14,527 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:14,532 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:37:15,411 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:37:15,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 18 treesize of output 20 [2022-07-23 05:37:15,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:37:15,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:15,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:16,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:16,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:16,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:16,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:16,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:16,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:17,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:17,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:37:17,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:17,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 18 treesize of output 20 [2022-07-23 05:37:17,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:17,648 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:37:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 392 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:17,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:21,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) 0) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)))) is different from false [2022-07-23 05:37:21,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) is different from false [2022-07-23 05:37:21,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:21,067 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:21,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:37:21,072 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:21,076 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:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-23 05:37:24,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173342329] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:24,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:24,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 52, 52] total 138 [2022-07-23 05:37:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520378101] [2022-07-23 05:37:24,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:24,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-23 05:37:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-23 05:37:24,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1812, Invalid=16813, Unknown=15, NotChecked=542, Total=19182 [2022-07-23 05:37:24,005 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:30,548 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2022-07-23 05:37:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-23 05:37:30,549 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-07-23 05:37:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:30,550 INFO L225 Difference]: With dead ends: 139 [2022-07-23 05:37:30,550 INFO L226 Difference]: Without dead ends: 139 [2022-07-23 05:37:30,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 161 SyntacticMatches, 17 SemanticMatches, 184 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6635 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=4812, Invalid=28769, Unknown=99, NotChecked=730, Total=34410 [2022-07-23 05:37:30,558 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 289 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 3448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:30,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1360 Invalid, 3448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2439 Invalid, 0 Unknown, 777 Unchecked, 1.1s Time] [2022-07-23 05:37:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-23 05:37:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-23 05:37:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-07-23 05:37:30,561 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 130 [2022-07-23 05:37:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:30,562 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-07-23 05:37:30,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-07-23 05:37:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 05:37:30,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:30,563 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:30,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-23 05:37:30,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-23 05:37:30,771 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:37:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1547261425, now seen corresponding path program 23 times [2022-07-23 05:37:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:30,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519266515] [2022-07-23 05:37:30,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:30,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 531 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519266515] [2022-07-23 05:37:31,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519266515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819637950] [2022-07-23 05:37:31,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:37:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:31,420 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:31,421 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:38,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-23 05:37:38,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:37:38,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-23 05:37:38,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:37:38,594 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:37:38,594 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:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:40,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:37:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:41,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819637950] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:37:41,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:37:41,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 91 [2022-07-23 05:37:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424583473] [2022-07-23 05:37:41,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:37:41,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-23 05:37:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:37:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-23 05:37:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=6882, Unknown=0, NotChecked=0, Total=8190 [2022-07-23 05:37:41,107 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:37:42,615 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-23 05:37:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 05:37:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-07-23 05:37:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:37:42,620 INFO L225 Difference]: With dead ends: 214 [2022-07-23 05:37:42,620 INFO L226 Difference]: Without dead ends: 146 [2022-07-23 05:37:42,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2802, Invalid=12948, Unknown=0, NotChecked=0, Total=15750 [2022-07-23 05:37:42,623 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 212 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:37:42,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 237 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:37:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-23 05:37:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-07-23 05:37:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-07-23 05:37:42,630 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2022-07-23 05:37:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:37:42,630 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-07-23 05:37:42,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:37:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-07-23 05:37:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-23 05:37:42,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:37:42,632 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:37:42,656 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:42,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-23 05:37:42,836 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:37:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:37:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash 524136654, now seen corresponding path program 24 times [2022-07-23 05:37:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:37:42,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983826789] [2022-07-23 05:37:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:37:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:37:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:37:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:37:45,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:37:45,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983826789] [2022-07-23 05:37:45,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983826789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:37:45,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322936826] [2022-07-23 05:37:45,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:37:45,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:37:45,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:37:45,286 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:45,287 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:38:25,337 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-23 05:38:25,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:38:25,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 284 conjunts are in the unsatisfiable core [2022-07-23 05:38:25,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:38:25,423 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:26,604 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:38:26,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:26,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:38:27,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:27,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:38:27,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:38:27,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:28,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:28,119 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:38:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:28,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:38:28,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-23 05:38:28,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:38:28,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2411) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:38:28,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:38:28,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2410 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2410) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2409) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2408) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2407) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2406) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2405) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2404) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2403) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:38:28,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2402) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:38:28,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:38:28,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2401) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)))) is different from false [2022-07-23 05:38:28,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:38:28,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2400 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2400) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2399) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2398) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-23 05:38:28,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2397) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:38:28,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:38:28,310 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:28,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:38:28,316 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:28,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:38:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 543 not checked. [2022-07-23 05:38:28,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322936826] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:38:28,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:38:28,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 57, 57] total 146 [2022-07-23 05:38:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61841973] [2022-07-23 05:38:28,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:38:28,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2022-07-23 05:38:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:38:28,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2022-07-23 05:38:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=12349, Unknown=33, NotChecked=8382, Total=21170 [2022-07-23 05:38:28,886 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:38:35,252 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-23 05:38:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-07-23 05:38:35,253 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-07-23 05:38:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:38:35,254 INFO L225 Difference]: With dead ends: 220 [2022-07-23 05:38:35,254 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 05:38:35,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 205 SyntacticMatches, 51 SemanticMatches, 179 ConstructedPredicates, 33 IntricatePredicates, 1 DeprecatedPredicates, 6480 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=614, Invalid=21241, Unknown=33, NotChecked=10692, Total=32580 [2022-07-23 05:38:35,256 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 60 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 5764 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 9821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 5764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3990 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:38:35,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2333 Invalid, 9821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 5764 Invalid, 0 Unknown, 3990 Unchecked, 2.0s Time] [2022-07-23 05:38:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 05:38:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-23 05:38:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-07-23 05:38:35,259 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2022-07-23 05:38:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:38:35,259 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-07-23 05:38:35,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-07-23 05:38:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-23 05:38:35,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:38:35,260 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:38:35,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-23 05:38:35,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:35,475 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:38:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:38:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1062251221, now seen corresponding path program 25 times [2022-07-23 05:38:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:38:35,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339107479] [2022-07-23 05:38:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:38:35,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:38:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:38:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 435 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:38:36,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339107479] [2022-07-23 05:38:36,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339107479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:38:36,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520564373] [2022-07-23 05:38:36,307 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:38:36,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:38:36,308 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:38:36,309 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:38:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:38:36,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 171 conjunts are in the unsatisfiable core [2022-07-23 05:38:36,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:38:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:37,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:38:38,170 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:38:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:38,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520564373] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:38:38,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:38:38,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 82 [2022-07-23 05:38:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297094806] [2022-07-23 05:38:38,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:38:38,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-23 05:38:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:38:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-23 05:38:38,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=6030, Unknown=0, NotChecked=0, Total=6806 [2022-07-23 05:38:38,260 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:38:40,368 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2022-07-23 05:38:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-23 05:38:40,369 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 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 146 [2022-07-23 05:38:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:38:40,369 INFO L225 Difference]: With dead ends: 153 [2022-07-23 05:38:40,369 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 05:38:40,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3186 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2753, Invalid=11767, Unknown=0, NotChecked=0, Total=14520 [2022-07-23 05:38:40,371 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 294 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 3118 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:38:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1052 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3118 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 05:38:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 05:38:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2022-07-23 05:38:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:38:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-23 05:38:40,373 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2022-07-23 05:38:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:38:40,374 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-23 05:38:40,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-23 05:38:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 05:38:40,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:38:40,375 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:38:40,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-23 05:38:40,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:40,589 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:38:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:38:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2125072764, now seen corresponding path program 26 times [2022-07-23 05:38:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:38:40,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436420243] [2022-07-23 05:38:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:38:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:38:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:38:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 36 proven. 1173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:38:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:38:43,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436420243] [2022-07-23 05:38:43,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436420243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:38:43,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611129287] [2022-07-23 05:38:43,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:38:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:38:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:38:43,215 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:38:43,216 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:38:43,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:38:43,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:38:43,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 281 conjunts are in the unsatisfiable core [2022-07-23 05:38:43,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:38:43,479 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:44,496 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:38:44,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:45,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:45,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:38:45,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:38:45,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:45,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:38:46,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:46,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 17 treesize of output 19 [2022-07-23 05:38:46,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:46,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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